Algorithmic Operations Research von Hromkovič Juraj , ETH Zurich, Mömke Tobias, Steinhöfel Kathleen , King's College London, Widmayer Peter , ETH Zurich, Hromkovič Juraj, ETH Zurich, Mömke Tobias, Widmayer Peter, ETH Zurich

Volltext bestellen

More on online bin packing with two item sizes von Epstein, Leah, Levin, Asaf

Volltext

Evaluation and comparison of integer programming solvers for hard real-time scheduling von Guasque Ortega, Ana, Balbastre, Patricia

Volltext bestellen

Cooperation in Multiorganization Matching von Gourvès, Laurent, Monnot, Jérôme, Pascual, Fanny

Volltext

Compatible Weights and Valid Cycles in Non-spanning OSPF Routing Patterns von Broström, Peter, Holmberg, Kaj

Volltext

Theoretical Aspects of Scheduling Coupled-Tasks in the Presence of Compatibility Graph von Giroudeau, Rodolphe, Darties, Benoit, König, Jean-Claude, Simonin, Gilles

Volltext

The Computational Efficiency of Ji-Lee-Li Algorithm for the Assignment Problem von Goldengorin, Boris, Jäger, Gerold

Volltext

Analysis and Comparison of Three Algorithms for the Vertex Cover Problem on Large Graphs with Low Memory Capacities von Angel, Eric, Campigotto, Romain, Laforest, Christian

Volltext

An Efficient Hybrid Ant Colony System for the Generalized Traveling Salesman Problem von Reihaneh, Mohammad, Karapetyan, Daniel

Volltext bestellen

Solutions diversification in a column generation algorithm von Touati Moungla, Nora, Létocart, Lucas, Nagih, Anass

Volltext

Solving some Multistage Robust Decision Problems with Huge Implicitly defined Scenario Trees von Minoux, Michel

Volltext

Approximable 1-Turn Routing Problems in All-Optical Mesh Networks von Palaysi, Jérôme, Bagan, Guillaume, Cogis, Olivier

Volltext

Polynomial Interior Point Algorithms for General Linear Complementarity Problems von Illés, Tibor, Nagy, Marianna, Terlaky, Tamás

Volltext

From Balls and Bins to Points and Vertices von Klasing, Ralf, Lotker, Zvi, Navarra, Alfredo, Pérennes, Stéphane

Volltext

Vertex 3-colorability of claw-free graphs von Kamiński, Marcin, Lozin, Vadim

Volltext

Some Necessary Conditions and a General Sufficiency Condition for the Validity of A Gilmore-Gomory Type Patching Scheme for the Traveling Salesman Problem von Baki, M. F., Kabadi, S. N.

Volltext

Hybrid Continuous Interacting Ant Colony aimed at enhanced global optimization von Dréo, J., Siarry, P.

Volltext

“Binarize and Project” to generate cuts for general mixed-integer programs von Roy, Jean-Sébastien

Volltext

Job Shop Scheduling with Unit Length Tasks: Bounds and Algorithms von Hromkovič, Juraj, Mömke, Tobias, Steinhöfel, Kathleen, Widmayer, Peter

Volltext

On-line Network Synthesis von Kabadi, S. N., Du, D.

Volltext