On the separation of maximally violated mod-\(k\) cuts
From MaRDI portal
Publication:1970294
DOI10.1007/s101079900107zbMath0959.90035OpenAlexW2169563629WikidataQ57702393 ScholiaQ57702393MaRDI QIDQ1970294
Adam N. Letchford, Alberto Caprara, Matteo Fischetti
Publication date: 2 May 2001
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s101079900107
integer programmingseparationasymmetric traveling salesman problemsymmetric traveling salesman problem
Related Items
Algorithms to separate \(\{0,\frac{1}{2}\}\)-Chvátal-Gomory cuts, Vašek Chvátal: a very short introduction (on the occasion of his 60th birthday), Applying mod-\(k\)-cuts for solving linear ordering problems, On the membership problem for the \({0, 1/2}\)-closure, Valid Inequalities and Separation Algorithms for the Set Partitioning Problem, New results on the windy postman problem, Rational and integral \(k\)-regular matrices., Limited memory rank-1 cuts for vehicle routing problems, A branch and cut solver for the maximum stable set problem, Chvátal-Gomory Rank-1 Cuts Used in a Dantzig-Wolfe Decomposition of the Vehicle Routing Problem with Time Windows, Metric inequalities and the network loading problem, A tutorial on branch and cut algorithms for the maximum stable set problem, On the domino-parity inequalities for the STSP, Chvatal--Gomory--tier cuts for general integer programs, Recent results on Arc Routing Problems: An annotated bibliography, A branch\&cut approach to recharging and refueling infrastructure planning, On cycles and the stable multi-set polytope, Totally tight Chvatal-Gomory cuts, Strengthening Chvátal-Gomory cuts and Gomory fractional cuts
