scientific article; zbMATH DE number 2064407

MaRDI QIDQ4461906zbMATH OpenFDO

Authors Matteo Fischetti, Andrea Lodi, Paolo Toth

Publication date 18 May 2004

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Cited in

(16)

• SelfSplit parallelization for mixed-integer linear programming
• Reducing the size of combinatorial optimization problems using the operator vaccine by fuzzy selector with adaptive heuristics
• Lower tolerance-based branch and bound algorithms for the ATSP
• Cut-and-solve: An iterative search strategy for combinatorial optimization problems
• Tolerance-based branch and bound algorithms for the ATSP
• Iterative patching and the asymmetric traveling salesman problem
• A branch-and-cut framework for the consistent traveling salesman problem
• The asymmetric bottleneck traveling salesman problem: algorithms, complexity and empirical analysis
• A data-guided lexisearch algorithm for the asymmetric traveling salesman problem
• Asymmetric multidepot vehicle routing problems: valid inequalities and a branch-and-cut algorithm
• Exact methods for solving the elementary shortest and longest path problems
• Deep clustering of the traveling salesman problem to parallelize its solution
• Parameter optimisation of the polynomial randomised algorithm for the asymmetric travelling salesman problem
• MILP models of a patient transportation problem
• On the integrality gap of small asymmetric traveling salesman problems: a polyhedral and computational approach
• Solving the asymmetric traveling purchaser problem

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4461906)