Search results for "subtour-elimination"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
67	Giorgio Carpaneto, Mauro Dell'Amico, Paolo Toth	Exact Solution of Large Scale Asymmetric Travelling Salesman Problems.	ACM Trans. Math. Softw.	1995	DBLP DOI BibTeX RDF	reduction procedure, subtour elimination, branch and bound, assignment problem, asymmetric traveling salesman problem
52	Christoph Helmberg	The m-Cost ATSP.	IPCO	1999	DBLP DOI BibTeX RDF
46	Lisa Fleischer, Éva Tardos	Separating Maximally Violated Comb Inequalities in Planar Graphs.	IPCO	1996	DBLP DOI BibTeX RDF
46	Joseph F. Pekny, Donald L. Miller	A Parallel Branch and Bound Algorithm for Solving Large Asymmetric Traveling Salesman Problems.	ACM Conference on Computer Science	1990	DBLP DOI BibTeX RDF
41	Robert D. Carr, Giuseppe Lancia	Compact optimization can outperform separation: A case study in structural proteomics.	4OR	2004	DBLP DOI BibTeX RDF	compact optimization, subtour-elimination, Linear programming, contact map
41	Giorgio Carpaneto, Mauro Dell'Amico, Paolo Toth	Algorithm 750: CDT: A Subroutine for the Exact Solution of Large-Scale Asymmetric Travelling Salesman Problems.	ACM Trans. Math. Softw.	1995	DBLP DOI BibTeX RDF	reduction procedure, subtour elimination, FORTRAN, branch and bound, assignment problem, asymmetric traveling salesman problem
38	Seiji Kataoka	A Subtour Elimination Constraint for Non-simpl e Circuit Problems.	J. Inf. Process.	2024	DBLP DOI BibTeX RDF
38	Thi Quynh Trang Vo, Mourad Baïou, Viet Hung Nguyen, Paul Weng	Improving Subtour Elimination Constraint Generation in Branch-and-Cut Algorithms for the TSP with Machine Learning.	LION	2023	DBLP DOI BibTeX RDF
38	Samuel C. Gutekunst, David P. Williamson	Subtour elimination constraints imply a matrix-tree theorem SDP constraint for the TSP.	Oper. Res. Lett.	2020	DBLP DOI BibTeX RDF
38	Yuan Yuan 0013, Diego Cattaruzza, Maxime Ogier, Frédéric Semet	A note on the lifted Miller-Tucker-Zemlin subtour elimination constraints for routing problems with time windows.	Oper. Res. Lett.	2020	DBLP DOI BibTeX RDF
38	Samuel C. Gutekunst, David P. Williamson	Subtour Elimination Constraints Imply a Matrix-Tree Theorem SDP Constraint for the TSP.	CoRR	2019	DBLP BibTeX RDF
38	Petar D. Jackovich, Bruce A. Cox, Raymond R. Hill	Comparing Greedy Constructive Heuristic Subtour Elimination Methods for the Traveling Salesman Problem.	CoRR	2019	DBLP BibTeX RDF
38	Ulrich Pferschy, Rostislav Stanek	Generating subtour elimination constraints for the TSP from pure integer solutions.	Central Eur. J. Oper. Res.	2017	DBLP DOI BibTeX RDF
38	Yingzong Liang, Chi-Wai Hui	Simultaneous subtour elimination model for single-stage multiproduct parallel batch scheduling with sequence dependent changeovers.	Comput. Chem. Eng.	2016	DBLP DOI BibTeX RDF
38	Tolga Bektas, Luis Eduardo Neves Gouveia	Requiem for the Miller-Tucker-Zemlin subtour elimination constraints?	Eur. J. Oper. Res.	2014	DBLP DOI BibTeX RDF
38	Michael Drexl	A note on the separation of subtour elimination constraints in elementary shortest path problems.	Eur. J. Oper. Res.	2013	DBLP DOI BibTeX RDF
38	Alistair R. Clark, Reinaldo Morabito, Eli A. V. Toso	Erratum to: Production setup-sequencing and lot-sizing at an animal nutrition plant through atsp subtour elimination and patching.	J. Sched.	2011	DBLP DOI BibTeX RDF
38	Alistair R. Clark, Reinaldo Morabito, Eli A. V. Toso	Production setup-sequencing and lot-sizing at an animal nutrition plant through atsp subtour elimination and patching.	J. Sched.	2010	DBLP DOI BibTeX RDF
38	Imdat Kara, Gilbert Laporte, Tolga Bektas	A note on the lifted Miller-Tucker-Zemlin subtour elimination constraints for the capacitated vehicle routing problem.	Eur. J. Oper. Res.	2004	DBLP DOI BibTeX RDF
38	Martin Desrochers, Gilbert Laporte	Improvements and extensions to the Miller-Tucker-Zemlin subtour elimination constraints.	Oper. Res. Lett.	1991	DBLP DOI BibTeX RDF
38	Norbert Ascheuer, Laureano F. Escudero, Martin Grötschel, Mechthild Stoer	On Identifying in Polynomial Time Violated Subtour Elimination and Precedence Forcing Constraints for the Sequential Ordering Problem.	IPCO	1990	DBLP BibTeX RDF
38	Mandell Bellmore, John C. Malone	Pathology of Traveling-Salesman Subtour-Elimination Algorithms.	Oper. Res.	1971	DBLP DOI BibTeX RDF
26	Andréa C. Santos 0001, Christophe Duhamel, Dario J. Aloise	Modeling the Mobile Oil Recovery Problem as a Multiobjective Vehicle Routing Problem.	MCO	2008	DBLP DOI BibTeX RDF	prize-collecting, Vehicle routing problem, multiobjective
26	Roberto Cordone, Marco Trubian	An exact algorithm for the node weighted Steiner tree problem.	4OR	2006	DBLP DOI BibTeX RDF	Prize collecting, Relax-and-cut, Steiner problem
26	Hande Yaman	Formulations and Valid Inequalities for the Heterogeneous Vehicle Routing Problem.	Math. Program.	2006	DBLP DOI BibTeX RDF	Heterogeneous vehicle routing problem, Mix fleet, projection, Lifting, Valid inequalities
26	Mehmet Tolga Çezik, Garud Iyengar	Cuts for mixed 0-1 conic programming.	Math. Program.	2005	DBLP DOI BibTeX RDF
26	Sylvia C. Boyd, Geneviève Labonté	Finding the Exact Integrality Gap for Small Traveling Salesman Problems.	IPCO	2002	DBLP DOI BibTeX RDF