Gerhard Reinelt

Stefan Fischer

Jeremy C. Smith

Multiscale Model. Simul., 2006

Maximally Violated Mod-p Cuts for the Capacitated Vehicle-Routing Problem.

[BibT_eX]

[DOI]

Klaus Michael Wenger

INFORMS J. Comput., 2006

A tabu search algorithm for the min-max k-Chinese postman problem.

[BibT_eX]

[DOI]

Dino Ahr

Comput. Oper. Res., 2006

Discovering functional gene expression patterns in the metabolic network of Escherichia coli with wavelets transforms.

[BibT_eX]

[DOI]

BMC Bioinform., 2006

Pattern recognition of gene expression data on biochemical networks with simple wavelet transforms.

[BibT_eX]

[DOI]

Proceedings of the LWA 2006: Lernen - Wissensentdeckung - Adaptivität, Hildesheim, Deutschland, October 9th-11th 2006, joint workshop event of several interest groups of the German Society for Informatics (GI) - 14th Workshop on Adaptivity and User Modeling in Interactive Systems (ABIS 2006) - Workshop Information Retrieval 2006 of the Special Interest Group Information Retrieval (FGIR 2006) - Workshop on Knowledge and Experience Management (FGWM 2006), 2006

Solving City Bus Scheduling Problems in Bangkok by Eligen-Algorithm.

[BibT_eX]

[DOI]

Chotiros Surapholchai

Hans Georg Bock

Proceedings of the Modeling, 2006

2005

Transformation of Facets of the General Routing Problem Polytope.

[BibT_eX]

[DOI]

Dirk Oliver Theis

SIAM J. Optim., 2005

Locating Health Facilities in Nouna District, Burkina Faso.

[BibT_eX]

[DOI]

Cara Cocking

Steffen Flessa

Proceedings of the Operations Research Proceedings 2005, 2005

Not Every GTSP Facet Induces an STSP Facet.

[BibT_eX]

[DOI]

Dirk Oliver Theis

Proceedings of the Integer Programming and Combinatorial Optimization, 2005

2004

Book review.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2004

An exact algorithm for scheduling identical coupled tasks.

[BibT_eX]

[DOI]

Math. Methods Oper. Res., 2004

A Faster Exact Separation Algorithm for Blossom Inequalities.

[BibT_eX]

[DOI]

Adam N. Letchford

Dirk Oliver Theis

Proceedings of the Integer Programming and Combinatorial Optimization, 2004

Computing Optimal Consecutive Ones Matrices.

[BibT_eX]

[DOI]

Proceedings of the Sharpest Cut, 2004

2003

The weighted consecutive ones problem for a fixed number of rows or columns.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2003

Advanced Column Generation Techniques for Crew Pairing Problems.

[BibT_eX]

[DOI]

Tran Van Hoai

Hans Georg Bock

Proceedings of the Modeling, 2003

2002

New Heuristics and Lower Bounds for the Min-Max k -Chinese Postman Problem.

[BibT_eX]

[DOI]

Dino Ahr

Proceedings of the Algorithms, 2002

2001

Decomposition and Parallelization Techniques for Enumerating the Facets of Combinatorial Polytopes.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2001

Algorithmic Aspects of Using Small Instance Relaxations in Parallel Branch-and-Cut.

[BibT_eX]

[DOI]

Algorithmica, 2001

Constructing New Facets of the Consecutive Ones Polytope.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization, 2001

2000

A Branch & Cut Algorithm for the Asymmetric Traveling Salesman Problem with Precedence Constraints.

[BibT_eX]

[DOI]

Norbert Ascheuer

Comput. Optim. Appl., 2000

Polyhedral Aspects of the Consecutive Ones Problem.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 6th Annual International Conference, 2000

1998

Consecutive Ones and a Betweenness Problem in Computational Biology.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 1998

1997

A Branch-and-Cut Approach to Physical Mapping of Chromosomes by Unique End-Probes.

[BibT_eX]

[DOI]

J. Comput. Biol., 1997

A branch-and-cut approach to physical mapping with end-probes.

[BibT_eX]

[DOI]

Proceedings of the First Annual International Conference on Research in Computational Molecular Biology, 1997

1996

A Polyhedral Approach to the Feedback Vertex Set Problem.

[BibT_eX]

[DOI]

Meinrad Funke

Proceedings of the Integer Programming and Combinatorial Optimization, 1996

1994

Quadratic 0/1 optimization and a decomposition approach for the placement of electronic circuits.

[BibT_eX]

[DOI]

Math. Program., 1994

Provably good solutions for the traveling salesman problem.

[BibT_eX]

[DOI]

Stefan Thienel

Math. Methods Oper. Res., 1994

The Traveling Salesman, Computational Solutions for TSP Applications

[BibT_eX]

[DOI]

Lecture Notes in Computer Science 840, Springer, ISBN: 3-540-58334-3, 1994

1993

Book reviews.

[BibT_eX]

[DOI]

ZOR Methods Model. Oper. Res., 1993

A Note on Small Linear-Ordering Polytopes.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 1993

Practical problem solving with cutting plane algorithms in combinatorialoptimization.

[BibT_eX]

[DOI]

Stefan Thienel

Proceedings of the Combinatorial Optimization, 1993

1992

Fast Heuristics for Large Geometric Traveling Salesman Problems.

[BibT_eX]

[DOI]

INFORMS J. Comput., 1992

1991

A complete description of the traveling salesman polytope on 8 nodes.

[BibT_eX]

[DOI]

Oper. Res. Lett., 1991

Optimal control of plotting and drilling machines: A case study.

[BibT_eX]

[DOI]

ZOR Methods Model. Oper. Res., 1991

TSPLIB - A Traveling Salesman Problem Library.

[BibT_eX]

[DOI]

INFORMS J. Comput., 1991

Computing correct Delaunay triangulations.

[BibT_eX]

[DOI]

Doris Zepf

Computing, 1991

1990

Polyedrische Methoden zur Lösung großer kombinatorischer Optimierungsprobleme.

[BibT_eX]

[DOI]

Proceedings of the GI, 1990

Computing the Convex Hull in the Euclidean Plane in Linear Expected Time.

[BibT_eX]

[DOI]

Proceedings of the Applied Geometry And Discrete Mathematics, 1990

1989

Experiments in quadratic 0-1 programming.

[BibT_eX]

[DOI]

Francisco Barahona

Math. Program., 1989

1988

An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design.

[BibT_eX]

[DOI]

Oper. Res., 1988

1987

Generalizations of Cliques, Odd Cycles and Anticycles and Their Relation to Independence System Polyhedra.

[BibT_eX]

[DOI]

Reinhardt Euler

Math. Oper. Res., 1987

1985

The linear ordering problem: algorithms and applications.

[BibT_eX]

[DOI]

PhD thesis, 1985

Facets of the linear ordering polytope.

[BibT_eX]

[DOI]

Math. Program., 1985

On the acyclic subgraph polytope.

[BibT_eX]

[DOI]

Math. Program., 1985

On partitioning the edges of graphs into connected subgraphs.

[BibT_eX]

[DOI]

William R. Pulleyblank

J. Graph Theory, 1985

1984

A Cutting Plane Algorithm for the Linear Ordering Problem.

[BibT_eX]

[DOI]