Integer Programming and Combinatorial Optimization
From MaRDI portal
Publication:5712453
DOI10.1007/b97946zbMath1092.90542OpenAlexW2484779063MaRDI QIDQ5712453
Dirk Oliver Theis, Adam N. Letchford, Gerhard Reinelt
Publication date: 23 December 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b97946
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Abstract computational complexity for mathematical programming problems (90C60)
Related Items
Improved approximation algorithms for metric maximum ATSP and maximum 3-cycle cover problems, A branch-and-cut framework for the consistent traveling salesman problem, A branch-and-cut algorithm for the profitable windy rural postman problem, Optimizing over the first Chvátal closure, Constraint relaxation for the discrete ordered median problem, Undirected postman problems with zigzagging option: a cutting-plane approach, Exploiting planarity in separation routines for the symmetric traveling salesman problem, The separation problem of rounded capacity inequalities: some polynomial cases, The hierarchical mixed rural postman problem: polyhedral analysis and a branch-and-cut algorithm, Robust branch-and-cut-and-price for the capacitated vehicle routing problem, Exact and Heuristic Algorithms for Capacitated Vehicle Routing Problems with Quadratic Costs Structure, OAR lib: an open source arc routing library, Solving the prize-collecting rural postman problem, Engineering Branch-and-Cut Algorithms for the Equicut Problem, Non delayed relax-and-cut algorithms, Branch-and-cut-and-price algorithms for the degree constrained minimum spanning tree problem
