|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 15 occurrences of 12 keywords
|
|
|
Results
Found 27 publication records. Showing 27 according to the selection in the facets
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Math. Softw. ![In: ACM Trans. Math. Softw. 21(4), pp. 394-409, 1995. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 7th International IPCO Conference, Graz, Austria, June 9-11, 1999, Proceedings, pp. 242-258, 1999, Springer, 3-540-66019-4. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
46 | Lisa Fleischer, Éva Tardos |
Separating Maximally Violated Comb Inequalities in Planar Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 5th International IPCO Conference, Vancouver, British Columbia, Canada, June 3-5, 1996, Proceedings, pp. 475-489, 1996, Springer, 3-540-61310-2. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Conference on Computer Science ![In: Proceedings of the ACM 18th Annual Computer Science Conference on Cooperation, CSC '90, Sheraton Washington Hotel, Washington, DC, USA, February 20-22, 1990, pp. 56-62, 1990, ACM, 0-89791-348-5. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
41 | Robert D. Carr, Giuseppe Lancia |
Compact optimization can outperform separation: A case study in structural proteomics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
4OR ![In: 4OR 2(3), pp. 221-233, 2004. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Math. Softw. ![In: ACM Trans. Math. Softw. 21(4), pp. 410-415, 1995. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Inf. Process. ![In: J. Inf. Process. 32, pp. 346-351, 2024. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LION ![In: Learning and Intelligent Optimization - 17th International Conference, LION 17, Nice, France, June 4-8, 2023, Revised Selected Papers, pp. 537-551, 2023, Springer, 978-3-031-44504-0. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Oper. Res. Lett. ![In: Oper. Res. Lett. 48(3), pp. 245-248, 2020. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Oper. Res. Lett. ![In: Oper. Res. Lett. 48(2), pp. 167-169, 2020. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1907.11669, 2019. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1910.08625, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
38 | Ulrich Pferschy, Rostislav Stanek |
Generating subtour elimination constraints for the TSP from pure integer solutions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Central Eur. J. Oper. Res. ![In: Central Eur. J. Oper. Res. 25(1), pp. 231-260, 2017. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Chem. Eng. ![In: Comput. Chem. Eng. 87, pp. 63-67, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
38 | Tolga Bektas, Luis Eduardo Neves Gouveia |
Requiem for the Miller-Tucker-Zemlin subtour elimination constraints? ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Oper. Res. ![In: Eur. J. Oper. Res. 236(3), pp. 820-832, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
38 | Michael Drexl |
A note on the separation of subtour elimination constraints in elementary shortest path problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Oper. Res. ![In: Eur. J. Oper. Res. 229(3), pp. 595-598, 2013. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Sched. ![In: J. Sched. 14(1), pp. 119, 2011. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Sched. ![In: J. Sched. 13(2), pp. 111-121, 2010. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Oper. Res. ![In: Eur. J. Oper. Res. 158(3), pp. 793-795, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
38 | Martin Desrochers, Gilbert Laporte |
Improvements and extensions to the Miller-Tucker-Zemlin subtour elimination constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Oper. Res. Lett. ![In: Oper. Res. Lett. 10(1), pp. 27-36, 1991. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Proceedings of the 1st Integer Programming and Combinatorial Optimization Conference, Waterloo, Ontorio, Canada, May 28-30 1990, pp. 19-28, 1990, University of Waterloo Press, 0-88898-099-X. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP BibTeX RDF |
|
38 | Mandell Bellmore, John C. Malone |
Pathology of Traveling-Salesman Subtour-Elimination Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Oper. Res. ![In: Oper. Res. 19(2), pp. 278-307, 1971. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MCO ![In: Modelling, Computation and Optimization in Information Systems and Management Sciences, Second International Conference, MCO 2008, Metz, France - Luxembourg, September 8-10, 2008. Proceedings, pp. 283-292, 2008, Springer, 978-3-540-87476-8. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
4OR ![In: 4OR 4(2), pp. 124-144, 2006. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Program. ![In: Math. Program. 106(2), pp. 365-390, 2006. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Program. ![In: Math. Program. 104(1), pp. 179-202, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
26 | Sylvia C. Boyd, Geneviève Labonté |
Finding the Exact Integrality Gap for Small Traveling Salesman Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 9th International IPCO Conference, Cambridge, MA, USA, May 27-29, 2002, Proceedings, pp. 83-92, 2002, Springer, 3-540-43676-6. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #27 of 27 (100 per page; Change: )
|
|