scientific article; zbMATH DE number 2064407
From MaRDI portal
zbMath1113.90351MaRDI QIDQ4461906
Matteo Fischetti, Andrea Lodi, Paolo Toth
Publication date: 18 May 2004
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)
Related Items
A branch-and-cut framework for the consistent traveling salesman problem, The asymmetric bottleneck traveling salesman problem: algorithms, complexity and empirical analysis, SelfSplit parallelization for mixed-integer linear programming, Solving the asymmetric traveling purchaser problem, Reducing the size of combinatorial optimization problems using the operator vaccine by fuzzy selector with adaptive heuristics, A data-guided lexisearch algorithm for the asymmetric traveling salesman problem, Cut-and-solve: An iterative search strategy for combinatorial optimization problems, Exact methods for solving the elementary shortest and longest path problems, Tolerance-based branch and bound algorithms for the ATSP, Lower tolerance-based branch and bound algorithms for the ATSP, Iterative patching and the asymmetric traveling salesman problem, Asymmetric Multidepot Vehicle Routing Problems: Valid Inequalities and a Branch-and-Cut Algorithm
