Items where Subject is "90-XX Operations research, mathematical programming > 90Cxx Mathematical programming > 90C27 Combinatorial optimization"

Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Group by: Authors | Item Type
Jump to: A | B | C | D | E | F | G | H | J | K | L | M | N | P | S | T | U | W | Z | Á
Number of items at this level: 127.

A

Althaus, Ernst and Bockmayr, Alexander and Elf, Matthias and Kasper, Thomas and Jünger, Michael and Mehlhorn, Kurt (2002) SCIL - Symbolic Constraints in Integer Linear Programming.
Published In: Algorithms - ESA 2002 : 10th annual European symposium, Rome, Italy, September 17 - 21, 2002 ; proceedings, Lecture notes in computer science. 2461 Springer 2002, pp. 75-87.

Anjos, Miguel and Ghaddar, Bissan and Hupp, Lena and Liers, Frauke and Wiegele, Angelika (2013) Solving k-way Graph Partitioning Problems to Optimality: The Impact of Semidefinite Relaxations and the Bundle Method.
Published in: Facets of Combinatorial Optimization : Festschrift for Martin Grötschel. Springer 2013, pp. 355-386.

Arkin, Esther M. and Fekete, Sandor P. and Mitchell, Joseph S. B. (2000) Approximation algorithms for lawn mowing and milling.
Published in: Computational geometry : theory and applications Vol. 17 (1-2). pp. 25-50.

Arnim, Annelie von and Schrader, Rainer and Wang, Yaoguang (1996) The Permutahedron of N-sparse Posets.
Published in: Mathematical programming : Series A Vol. 75 (1). pp. 1-18.

B

Bachem, Achim and Hamacher, Anja and Moll, Christoph and Raspel, Guido (1997) Optimale Linienführung und Routenplanung in Verkehrssystemen.
Published in: Mathematik : Schlüsseltechnologie für die Zukunft ; Verbundprojekte zwischen Universität und Industrie. Springer 1997, pp. 626-636.

Bachem, Achim and Hochstättler, Winfried and Malich, Martin (1994) Simulated Trading - A New Parallel Approach For Solving Vehicle Routing Problems.
Published In: Parallel computing : trends and applications ; proceedings of the International Conference ParCo93, Grenoble, France, 7 - 10 September, 1993, Advances in parallel computing. 9 North-Holland 1994, pp. 471-475.

Bachem, Achim and Hochstättler, Winfried and Malich, Martin (1993) Simulated Trading - Eine kurze Einführung.
Published in: PARS-Mitteilungen Vol. 11. pp. 81-87.

Bachem, Achim and Hochstättler, Winfried and Malich, Martin (1996) The Simulated Trading Heuristic for Solving Vehicle Routing Problems.
Published in: Discrete applied mathematics Vol. 65 (1-3). pp. 47-72.

Bachem, Achim and Kern, Walter (1992) Linear Programming Duality : An Introduction to Oriented Matroids. Universitext . Springer, Berlin .

Bachem, Achim and Steckemetz, Barthel and Wottawa, Michael (1994) An efficient parallel cluster-heuristic for large TSPs.
Technical Report , 10 p.

Bachem, Achim and Wottawa, Michael (1991) Ein 18512-Städte (Deutschland-)Traveling-Salesman-Problem.
Technical Report , 2 p.

Bachem, Achim and Wottawa, Michael (1992) Parallelisierung von Heuristiken für große Traveling Salesman Probleme.
Published In: Parallele Datenverarbeitung mit dem Transputer : 4. Transputer-Anwender-Treffen TAT '92, Aachen, 22. - 23. September 1992, Informatik aktuell. Springer 1992, p. 12.

Barahona, Francisco and Grötschel, Martin and Jünger, Michael and Reinelt, Gerhard (1988) An Application of Combinatorial Optimization to Statistical Physics and Circiut Layout Design.
Published in: Operations Research Vol. 36 (3). pp. 493-513. ISSN 0030-364X

Barahona, Francisco and Jünger, Michael and Reinelt, Gerhard (1989) Experiments in Quadratic 0–1 Programming.
Published in: Mathematical Programming Vol. 44 (1-3). pp. 127-137. ISSN 0025-5610

Barvinok, A. and Fekete, Sandor P. and Johnson, David S. and Tamir, Arie and Woeginger, Gerhard J. and Woodroofe, D. (1998) The Maximum Traveling Salesman Problem.

Bauer, Petra (1997) The Circuit Polytope: Facets.
Published in: Mathematics of operations research Vol. 22 (1). pp. 110-145.

Baumann, Frank and Buchheim, Christoph (2009) Compact and Extended Formulations for Range Assignment Problems.
Technical Report , 14 p.

Behle, Markus and Jünger, Michael and Liers, Frauke (2007) A Primal Branch-and-Cut Algorithm for the Degree-Constrained Minimum Spanning Tree Problem.
Published In: Experimental algorithms : 6th international workshop ; proceedings / WEA 2007, Rome, Italy, June 6 - 8, Lecture Notes in Computer Science. 4525 Springer 2007, pp. 379-392.

Blasum, Ulrich and Bussieck, M. and Hochstättler, Winfried and Moll, Christoph and Scheel, Hans-Helmut and Winter, Thomas (1999) Scheduling Trams in the Morning.
Published in: Mathematical Methods of Operations Research Vol. 49 (1). pp. 137-148.

Bomze, Immanuel and Chimani, Markus and Jünger, Michael and Ljubic, Ivana and Mutzel, Petra and Zey, Bernd (2011) Solving Two-Stage Stochastic Steiner Tree Problems by Two-Stage Branch-and-Cut.
Published In: ISAAC 2010, Part I, LNCS. 6506 Springer-Verlag 2011, pp. 427-439.

Bonato, Thorsten and Jünger, Michael and Reinelt, Gerhard and Rinaldi, Giovanni (2013) Lifting and Separation Procedures for the Cut Polytope.
Published in: Mathematical Programming A. ISSN 0025-5610

Buchheim, Christoph and Liers, Frauke and Oswald, Marcus (2008) A Basic Toolbox for Constrained Quadratic 0/1 Optimization.
Published In: Experimental algorithms 7th international workshop, WEA 2008, Provincetown, MA, USA, May 30 - June 1, 2008 ; proceedings, Lecture Notes in Computer Science. 5038 Springer 2008, pp. 249-262.

Buchheim, Christoph and Liers, Frauke and Oswald, Marcus (2008) Local Cuts Revisited.
Published in: Operations Research Letters Vol. 36 (4). pp. 430-433.

Buchheim, Christoph and Liers, Frauke and Oswald, Marcus (2010) Speeding up IP-based Algorithms for Constrained Quadratic 0-1 Optimization.
Published in: Mathematical Programming B Vol. 124 (1-2). pp. 513-535.

Buchheim, Christoph and Liers, Frauke and Sanita, Laura (2011) An Exact Algorithm for Robust Network Design.
Published In: Network Optimization : 5th International Conference, INOC 2011, Hamburg, Germany, June 13-16, Lecture notes in computer science. 6701 Springer Verlag 2011, pp. 7-14.

C

Cacchiani, Valentina and Jünger, Michael and Liers, Frauke and Lodi, Andrea and Schmidt, Daniel R. (2014) Single-Commodity Robust Network Design with Finite and Hose Demand Sets.
Technical Report , 32 p.
Submitted

Cacchiani, Valentina and Jünger, Michael and Liers, Frauke and Lodi, Andrea and Schmidt, Daniel R. (2016) Single-commodity robust network design with finite and Hose demand sets.
Published in: Mathematical Programming Vol. 157 (1). pp. 297-342. ISSN 0025-5610

D

Derigs, Ulrich and Goecke, Oskar and Schrader, Rainer (1986) Monge sequences and a simple assignment algorithm.
Published in: Discrete Applied Mathematics Vol. 15 (2-3). pp. 241-248.

E

Elf, Matthias and Gutwenger, Carsten and Jünger, Michael and Rinaldi, Giovanni (2001) Branch-and-Cut Algorithms for Combinatorial Optimization and Their Implementation in ABACUS.
Published in: Computational Combinatorial Optimization: Optimal or Provably Near-Optimal Solutions., Lecture Notes in Computer Science. 2241 Springer 2001, pp. 157-222.

Engels, Birgit (2010) The Transitive Minimum Manhattan Subnetwork Problem in 3 Dimensions.
Published in: Discrete Applied Mathematics Vol. 158 (4). pp. 298-307.

F

Faigle, Ulrich and Fekete, Sandor P. and Hochstättler, Winfried and Kern, Walter (1998) The Nucleon of Cooperative Games and an Algorithm for Matching Games.
Published in: Mathematical Programming Vol. 83 (1-3). pp. 195-211.

Faigle, Ulrich and Fekete, Sandor P. and Hochstättler, Winfried and Kern, Walter (1998) On approximately fair cost allocation in Euclidean TSP games.
Published in: OR Spektrum Vol. 20 (1). pp. 29-37.

Faigle, Ulrich and Fekete, Sandor P. and Hochstättler, Winfried and Kern, Walter (1997) On the Complexity of Testing Membership in the Core of Min-cost Spanning Tree Games.
Published in: International Journal of Game Theory Vol. 26 (3). pp. 361-366.

Faigle, Ulrich and Kern, Walter (1991) Note on the Convergence of Simulated Annealing Algorithms.
Published in: SIAM journal on control and optimization Vol. 29 (1). pp. 153-159.

Faigle, Ulrich and Kern, Walter (1992) Some Convergence Results for Probabilistic Tabu Search.
Published in: ORSA journal on computing Vol. 4 (1). pp. 32-37.

Faigle, Ulrich and Kern, Walter (1999) An algebraic framework for the greedy algorithm with applications to the core and Weber set of cooperative games.
Technical Report , 23 p.

Faigle, Ulrich and Kern, Walter and Kuipers, Jeroen (2001) On the computation of the nucleolus of a cooperative game.
Published in: International journal of game theory : official journal of the Game Theory Society Vol. 30 (1). pp. 79-98.

Faigle, Ulrich and Kern, Walter and Paulusma, D. (2000) Note on the computational complexity of least core concepts for min-cost spanning tree games.
Published in: Mathematical methods of operations research Vol. 52 (1). pp. 23-38.

Faigle, Ulrich and Kern, Walter and Turán, Gyorgy (1989) On the performance of on-line algorithms for partition problems.
Published in: Acta Cybernetica : forum centrale publicationum cyberneticarum Hungaricum Vol. 9 (2). pp. 107-119.

Faigle, Ulrich and Schrader, Rainer and Suletzki, R. (1987) A cutting plane algorithm for optimal graph partitioning.
Published in: Methods of Operations Research Vol. 57. pp. 109-116.

Faigle, Ulrich and Turán, György and Laszlo, Lovasz and Schrader, Rainer (1985) Search problems in ordered sets.
Published In: Operations research proceedings 1984 : DGOR, papers of the 13th annual Meeting Springer 1985, pp. 411-415.

Fanghänel, Diana and Liers, Frauke (2008) A Fast Exact Algorithm for the Optimum Cooperation Problem.
Technical Report , 14 p.

Fanghänel, Diana and Liers, Frauke (2010) A Fast Exact Algorithm for the Problem of Optimum Cooperation and Structure of Its Solutions.
Published in: Journal of Combinatorial Optimization Vol. 19 (3). pp. 369-393.

Fekete, Sandor P. (1998) Finding maximum length tours under Euclidean norms.
Technical Report , 5 p.

Fekete, Sandor P. (1997) Geometric Ideas for Graph Representation and for Cooperative Game Theory.
Technical Report , 54 p.

Fekete, Sandor P. (1999) Simplicity and Hardness of the Maximum Traveling Salesman Problem under Geometric Distances.
Published In: Soda'99 : Proceedings of the tenth annual ACM-SIAM Symposium on Discrete Algorithms ; Baltimore, Maryland, January 17 - 19, 1999 ACM 1999, pp. 337-345.

Fekete, Sandor P. and Khuller, Samir and Klemmstein, Monika and Raghavachari, Balaji and Young, Neal (1997) A network-flow technique for finding low-weight bounded-degree spanning trees.
Published in: Journal of Algorithms Vol. 24 (2). pp. 310-324.

Fekete, Sandor P. and Khuller, Samir and Klemmstein, Monika and Raghavachari, Balaji and Young, Neal (1996) A network-flow technique for finding low-weight bounded-degree spanning trees.
Published In: Integer programming and combinatorial optimization : 5th International IPCO Conference, Vancouver, British Columbia, Canada, June 3 - 5, 1996 ; proceedings, Lecture notes in computer science. 1084 Springer 1996, pp. 105-117.

Fekete, Sandor P. and Klemmstein, Monika (1995) Worst-case ratios for degree-constrained trees.
Published In: Proceedings of the 4th Biannual Twente Workshop on Graph Theory and Discrete Optimization 1995, pp. 103-106.

Fekete, Sandor P. and Meijer, Henk (1998) On Maximum Matchings and Minimum Steiner Stars.
Technical Report , 11 p.

Fekete, Sandor P. and Meijer, Henk (2000) On Minimum Stars and Maximum Matchings.
Published in: Discrete & computational geometry : an international journal of mathematics and computer science Vol. 23 (3). pp. 389-407.

Fekete, Sandor P. and Meijer, Henk (1999) On Minimum Stars, Minimum Steiner Stars, and Maximum Matchings.
Published In: Proceedings of the Fifteenth Annual Symposium on Computational Geometry : SCG '99 ; June 13- 16, 1999, Miami Beach, Florida ACM 1999, pp. 217-226.

Fekete, Sandor P. and Pulleyblank, William R. (1998) A note on the Traveling Preacher Problem.
Technical Report , 5 p.

Fekete, Sandor P. and Schepers, Jörg (2001) New classes of fast lower bounds for bin packing problems.
Published in: Mathematical programming : Series A Vol. 91 (1). pp. 11-31.

Fekete, Sandor P. and Schepers, Jörg (1998) New classes of lower bounds for bin packing problems.
Published In: Integer programming and combinatorial optimization : proceedings / 6th International IPCO Conference, Houston, Texas, June 22 - 24, 1998, Lecture notes in computer science. 1412 Springer 1998, pp. 257-270.

G

Gassner, Elisabeth and Percan, Merijam (2006) On the Weighted Minimal Deletion of Rooted Bipartite Minors.
Technical Report , 35 p.

Genc, Zuelfuekar and Speckenmeyer, Ewald (2001) Fahrplanoptimierung im ÖPNV.
Technical Report , 7 p.

Ghaddar, Bissan and Anjos, Miguel and Liers, Frauke (2007) A Branch-and-Cut Algorithm based on Semidefinite Programming for the Minimum k-Partition Problem.
Published in: Annals of Operations Research Vol. 188 (1). pp. 155-174.

Grötschel, Martin and Jünger, Michael and Reinelt, Gerhard (1991) Optimal Control of plotting and drilling Machines: a Case Study.
Published in: ZOR - Methods of Operations Research (35). pp. 61-84.

H

Hamacher, Anja (1997) Baumzerlegungen unter Nebenbedingungen -- Ein Clusterverfahren zur Lösung praktischer Vehicle-Routing-Probleme. ["eprint_fieldopt_thesis_type_phd" not defined] thesis.

Hamacher, Anja and Hochstättler, Winfried and Moll, Christoph (2000) Tree Partitioning under Constraints -- Clustering for Vehicle Routing Problems.
Published in: Discrete Applied Mathematics Vol. 99 (1-3). pp. 55-69.

Hamacher, Anja and Moll, Christoph (1997) A New Heuristic for Vehicle Routing with Narrow Time Windows.
Published In: Selected papers of the Symposium on Operations Research (SOR) : Braunschweig, September 3 - 6, 1996 Springer 1997, pp. 301-306.

Heusch, Peter and Meisgen, Frank and Speckenmeyer, Ewald (1997) CATS - Computer Aided Tram Scheduling.
Technical Report , 7 p.

Hochstättler, Winfried (1997) Duality in Combinatorial Optimization -- Sometimes it Works, Sometimes it Won't.
Technical Report , 57 p.

Hochstättler, Winfried (1996) Semidefinite Programmierung.
Technical Report , 95 p.

Hochstättler, Winfried and Nesetril, Jaroslav (1999) Linear Programming Duality and Morphisms.
Published in: Commentationes mathematicae Universitatis Carolinae : CMUC Vol. 40 (3). pp. 577-592.

Hochstättler, Winfried and Nesetril, Jaroslav (1997) Menger's Theorem as Morphism Duality.
Technical Report , 5 p.

Hochstättler, Winfried and Nesetril, Jaroslav (2000) A Note on MaxFlow-MinCut and Homomorphic Equivalence in Matroids.
Published in: Journal of algebraic combinatorics : an international journal Vol. 12 (3). pp. 295-300.

Hunting, Marcel and Faigle, Ulrich and Kern, Walter (2001) A Lagrangian relaxation approach to the edge-weighted clique problem.
Published in: European Journal of Operational Research : EJOR Vol. 131 (1). pp. 119-131.

J

Jabrayilov, Adalat and Mallach, Sven and Mutzel, Petra and Rüegg, Ulf and von Hanxleden, Reinhard (2016) Compact Layered Drawings of General Directed Graphs.
To appear In: Proceedings of the 24th International Symposium on Graph Drawing & Network Visualization, Lecture Notes in Computer Science. 9801 Springer 2016.

Jünger, Michael and Kaibel, Volker (1996) A Basic Study of the QAP-Polytope.
Technical Report , 20 p.

Jünger, Michael and Kaibel, Volker (2000) On the SQAP-Polytope.
Published in: SIAM Journal on Optimization Vol. 11 (2). pp. 444-463.

Jünger, Michael and Kaibel, Volker (2001) The QAP-Polytope and the Star-Transformation.
Published in: Discrete Applied Mathematics Vol. 111 (3). pp. 283-306.

Jünger, Michael and Liers, Frauke (2005) Determining Maximum Cuts in Graphs Coming from Theoretical Physics.
Technical Report , 6 p.

Jünger, Michael and Mallach, Sven (2015) An Integer Programming Approach to Optimal Basic Block Instruction Scheduling for Single-Issue Processors.
Published in: Discrete Optimization (Special Issue on Combinatorial Optimization). ISSN 1572-5286

Jünger, Michael and Mallach, Sven (2013) Solving the Simple Offset Assignment Problem as a Traveling Salesman.
Published In: M-SCOPES '13: Proceedings of the 16th International Workshop on Software and Compilers for Embedded Systems ACM 2013, pp. 31-39.

Jünger, Michael and Mutzel, Petra (1993) Solving the Maximum Weight Planar Subgraph Problem by Branch-and-Cut.
Published In: Proc. third conference of integer programming and combinatorial optimization (IPCO) IPCO Conference 1993, pp. 479-492.

Jünger, Michael and Mutzel, Petra and Odenthal, Thomas and Scharbrodt, Mark (1994) The Thickness of Graphs without K5-Minors.
Technical Report , 10 p.

Jünger, Michael and Reinelt, Gerhard and Rinaldi, Giovanni (1995) The Traveling Salesman Problem.
Published in: The Traveling Salesman Problem., Handbooks in Operations Reserach and Management Sciences. Elsevier 1995, pp. 225-330.

Jünger, Michael and Reinelt, Gerhard and Thienel, Stefan (1995) Practical Problem Solving with cutting Plane Algorithms in Combinatorial Optimization.
Published in: Practical Problem Solving with cutting Plane Algorithms in Combinatorial Optimization., DIMACS Series in Discrete Mathematics and Theoretical Computer Sciences. American Mathematical Society 1995, pp. 111-152.

Jünger, Michael and Störmer, Peter (1995) Solving large-scale traveling salesman problems with parallel Branch-and-Cut.
Technical Report , 35 p.

K

Kaibel, Volker (1997) Polyhedral Combinatorics of QAPs with Less Objects than Locations (Extended Abstract).
Technical Report , 10 p.

Katzgraber, Helmut G. and Körner, Mathias and Liers, Frauke and Hartmann, Alexander K. (2005) Overcoming system-size limitations in spin glasses.
Published in: Progress of theoretical physics : Supplement (157). pp. 59-65.

Katzgraber, Helmut G. and Körner, Mathias and Liers, Frauke and Jünger, Michael and Hartmann, Alexander K. (2005) Universality-class dependence of energy distributions in spin glasses.
Published in: Physical Review B Vol. 72 (9). 094421.

Kuckertz, Patrick and Ullrich, Oliver and Randerath, Hubert (2012) A simulation based approach on robust airline job pairing.
Published in: Simulation Notes Europe Vol. 22 (2). pp. 77-82. ISSN 2305-9974

L

Leclerc, Matthias and Rendl, Franz (1989) A Multiply Constrained Matroid Optimization Problem.
Published in: Discrete mathematics Vol. 73 (1-2). pp. 207-212.

Leclerc, Matthias and Rendl, Franz (1990) k-Best constrained bases of a matroid.
Published in: Zeitschrift für Operations-Research : ZOR ; mathematical methods of operations research Vol. 34 (2). pp. 79-89.

Liers, Frauke and Jünger, Michael and Reinelt, Gerhard and Rinaldi, Giovanni (2004) Computing Exact Ground States of Hard Ising Spin Glass Problems by Branch-and-Cut.
Published in: New Optimization Algorithms in Physics. Wiley 2004, pp. 47-68.

Liers, Frauke and Lukic, Jovanka and Marinari, Enzo and Pelissetto, Andrea and Vicari, Ettore (2007) Zero-temperature behavior of the random-anisotropy model in the strong-anisotropy limit.
Published in: Physical Review B Vol. 76 (17). p. 174423.

Liers, Frauke and Marinari, Enzo and Pagacz, Ulrike and Ricci-Tersenghi, Federico and Schmitz, Vera (2010) A Non-Disordered Glassy Model with a Tunable Interaction Range.
Published in: Journal of Statistical Mechanics: Theory and Experiment Vol. 2010 (5). L05003.

Liers, Frauke and Martin, Olivier C. (2007) Magnetic exponents of two-dimensional spin glasses.
Published in: Physical Review B Vol. 76 (6). 060405.

Liers, Frauke and Palassini, Matteo and Hartmann, Alexander K. and Jünger, Michael (2003) Ground state of the Bethe lattice spin glass and running time of an exact optimization algorithm.
Published in: Physical Review B Vol. 68 (9). 094406.

Lückerath, Daniel (2012) Thoughts on restauration of regular tram operation.
Published In: Proceedings of Sommertreffen Verkehrssimulation 2012, ASIM-Mitteilungen. AM 145 ARGESIM/ASIM Pub., TU Vienna/Austria. Ullrich, O.; Lückerath, D.(Ed.) August 2012, pp. 5-7.

Lückerath, Daniel and Ullrich, Oliver and Kupicha, Aleksander and Speckenmeyer, Ewald (2014) Multi-depot multi-vehicle-type vehicle scheduling for Cologne’s tram network.
Published In: Proceedings of ASIM-Workshop STS/GMMS 2014, ASIM Mitteilungen. AM 149 ARGESIM/ASIM Pub., TU Vienna/Austria, Scheible, J.; Bausch-Gall, I.; Deatcu, C. (Ed.) February 2014, pp. 191-197.

Lückerath, Daniel and Ullrich, Oliver and Speckenmeyer, Ewald (2013) Applicability of rescheduling strategies in tram networks.
Published In: Proceedings of ASIM-Treffen STS/GMMS 2013, ASIM-Mitteilungen. AM 145 ARGESIM/ASIM Pub., TU Vienna/Austria. Reichardt, R. (Ed.) February 2013.

M

Malich, Martin (1995) Simulated-Trading - Ein paralleles Verfahren zur Lösung von kombinatorischen Optimierungsproblemen. ["eprint_fieldopt_thesis_type_phd" not defined] thesis.

Mallach, Sven (2015) Exact Integer Programming Approaches to Sequential Instruction Scheduling and Offset Assignment. ["eprint_fieldopt_thesis_type_phd" not defined] thesis.

Mallach, Sven (2016) Improved Mixed-Integer Programming Models for Multiprocessor Scheduling with Communication Delays.
Technical Report , 30 p.

Mallach, Sven (2015) More General Optimal Offset Assignment.
Published in: Leibniz Transactions on Embedded Systems Vol. 2 (1). 02--1-02--18. ISSN 2199-2002

Mallach, Sven and Lozano, Roberto Castañeda (2014) Optimal general offset assignment.
Published In: Proceedings of the 17th International Workshop on Software and Compilers for Embedded Systems - SCOPES '14 ACM 2014, pp. 50-59.

Meisgen, Frank and Speckenmeyer, Ewald (1997) Dynamic Load Balancing on Clusters of Heterogeneous Workstations.
Technical Report , 13 p.

Mutzel, Petra (1994) s-Chorded Cycle Graphs and their Relation to the Planar Subgraph Polytope.
Technical Report , 13 p.

Mutzel, Petra and Jünger, Michael (2004) Graph Drawing: Exact Optimization helps!
Published in: The sharpest cut: the impact of Manfred Padberg and his work ; [invited lectures given at a workshop held in October 2001 to celebrate Padberg's 60th birthday ; Workshop in Honor of Manfred Padberg]., MPS-SIAM series on optimization. 4 SIAM 2004.

N

Naddef, Denis and Thienel, Stefan (2002) Efficient Separation Routines for the Symmetric Traveling Salesman -- Problem I: General Tools and Comb Separation.
Published in: Mathematical programming : Series A Vol. 92 (2). pp. 237-255.

Naddef, Denis and Thienel, Stefan (2002) Efficient Separation Routines for the Symmetric Traveling Salesman -- Problem II: Separating multi Handle Inequalities.
Published in: Mathematical programming : Series A Vol. 92 (2). pp. 257-283.

P

Palassini, Matteo and Liers, Frauke and Jünger, Michael and Young, A. Peter (2003) Low Energy Excitations in Spin Glasses from Exact Ground States.
Published in: Physical Review B Vol. 68 (6). 064413.

Pardella, Gregor and Liers, Frauke (2008) Exact Ground States of Large Two-Dimensional Planar Ising Spin Glasses.
Published in: Physical Review E Vol. 78 (5). 056705.

Pickl, Stefan (2000) Optimization of the TEM Model -- Co-Funding and Joint International Emissions Trading.
Published In: Operations research proceedings 2000 : Selected papers of the Symposium on operations research (OR 2000) ; Dresden, September 9 - 12 Springer 2000, pp. 113-118.

S

Schepers, Jörg (1997) An Exact Algorithm for General Orthogonal n-dimensional Knapsack Problems.
Published In: Selected papers of the Symposium on Operations Research (SOR) : Braunschweig, September 3 - 6, 1996 Springer 1997, pp. 129-133.

Schepers, Jörg (1997) Exakte Algorithmen für orthogonale Packungsprobleme. ["eprint_fieldopt_thesis_type_phd" not defined] thesis.

Schepers, Jörg and Wottawa, Michael (1996) Warehouse Optimization: Packing-algorithms for goods with complex geometries.
Published In: Selected papers of the Symposium on Operations Research (SOR'95) : Passau, September 13 - September 15, 1995 Springer 1996, pp. 125-131.

Schrader, Rainer and Wambach, Georg (1994) Integer polyhedra from supermodular functions on series-parallel posets.
Technical Report , 13 p.

Schrader, Rainer and Wambach, Georg (1997) The Setup Polyhedron of Series-Parallel Posets.
Published in: Discrete Applied Mathematics Vol. 79 (1-3). pp. 213-221.

Schrader, Rainer and Wambach, Georg (1999) The setup polytope of N-sparse posets.
Published in: Annals of Operations Research Vol. 92. pp. 125-142.

Srivastav, Anand and Stangier, Peter (1996) Algorithmic Chernoff-Hoeffding Inequalities in Integer Programming.
Published In: Algorithms and Computation : 5th International Symposium, ISAAC '94 Beijing, P. R. China, August 2527, 1994 Proceedings, Lecture notes in computer science. 834 Springer 1996, pp. 226-233.

Srivastav, Anand and Stangier, Peter (1996) Algorithmic Chernoff-Hoeffding Inequalities in Integer Programming.
Published in: Random structures & algorithms Vol. 8 (1). pp. 27-58.

T

Thienel, Stefan (1996) ABACUS - A Branch-And-CUt System, Version 1.2, User's Guide and Reference Manual.
Technical Report p.

Thienel, Stefan (1997) ABACUS - A Branch-And-CUt System, Version 2.0, User's Guide and Reference Manual.
Manual , 350 p.

Thienel, Stefan (1996) A Simple TSP-Solver: An ABACUS Tutorial.
Technical Report , 34 p.

Thienel, Stefan and Jünger, Michael (1997) The Design of the Branch-and-Cut System ABACUS.
Technical Report , 30 p.

U

Ullrich, Oliver (2014) Modellbasierte Parallelisierung von Anwendungen zur Verkehrssimulation - Ein dynamischer und adaptiver Ansatz. ["eprint_fieldopt_thesis_type_phd" not defined] thesis.

Ullrich, Oliver and Lückerath, Daniel and Franz, Sebastian and Speckenmeyer, Ewald (2012) Simulation and optimization of Cologne's tram schedule.
Published in: Simulation Notes Europe Vol. 22 (2). pp. 69-76. ISSN 2305-9974

Ullrich, Oliver and Lückerath, Daniel and Speckenmeyer, Ewald (2014) Reduzieren robuste Fahrpläne Verspätungen in Stadtbahnnetzen? - Es kommt drauf an!
Published In: Heureka' 14 Optimierung in Verkehr und Transport FGSV Verlag April 2014, pp. 448-465.

Ullrich, Oliver and Lückerath, Daniel and Speckenmeyer, Ewald (2015) A robust schedule for Montpellier's Tramway network.
Published in: Simulation Notes Europe Vol. 25 (1). pp. 1-8. ISSN 2306-0271

W

Wottawa, Michael (1996) Struktur und algorithmische Behandlung von praxisorientierten dreidimensionalen Packungsproblemen. ["eprint_fieldopt_thesis_type_phd" not defined] thesis.

Z

Zimmermann, Uwe (1986) Linear and Combinatorial Sharing Problems.
Published in: Discrete applied mathematics Vol. 15 (1). pp. 85-104.

Á

Álvarez-Miranda, Eduardo and Cacchiani, Valentina and Dorneth, Tim and Jünger, Michael and Liers, Frauke and Lodi, Andrea and Parriani, Tiziano and Schmidt, Daniel R. (2012) Models and Algorithms for Robust Network Design with Several Traffic Scenarios.
Published In: Combinatorial Optimization : Second International Symposium, ISCO 2012, Athens, Greece, April 19-21, 2012, Revised Selected Papers, Lecture notes in computer science. 7422 Springer-Verlag 2012, pp. 261-272.

This list was generated on Tue Oct 24 09:09:29 2017 CEST.