scientific article; zbMATH DE number 2064406

zbMath1113.90349MaRDI QIDQ4461905

Matteo Fischetti, Egon Balas

Publication date: 18 May 2004

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Related Items

SelfSplit parallelization for mixed-integer linear programming, Tight lower bounds for the traveling salesman problem with draft limits, The time dependent traveling salesman problem: polyhedra and algorithm, Facet Generating Techniques, The ring-star problem: a new integer programming formulation and a branch-and-cut algorithm, Facets from gadgets, Polyhedral results and a branch-and-cut algorithm for the double traveling salesman problem with multiple stacks, Exact algorithms for the traveling salesman problem with draft limits, The traveling salesman problem with draft limits, New facets of the STS polytope generated from known facets of the ATS polytope, Asymmetric Multidepot Vehicle Routing Problems: Valid Inequalities and a Branch-and-Cut Algorithm