Search results for "branch and cut algorithms"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
2	Matthias Elf, Carsten Gutwenger, Michael Jünger, Giovanni Rinaldi	Branch-and-Cut Algorithms for Combinatorial Optimization and Their Implementation in ABACUS.	Computational Combinatorial Optimization	2001	DBLP DOI BibTeX RDF
2	Alexander Martin	General Mixed Integer Programming: Computational Issues for Branch-and-Cut Algorithms.	Computational Combinatorial Optimization	2001	DBLP DOI BibTeX RDF
1	Alysson M. Costa, Jean-François Cordeau, Gilbert Laporte	Models and branch-and-cut algorithms for the Steiner tree problem with revenues, budget and hop constraints.	Networks	2009	DBLP DOI BibTeX RDF
1	John E. Mitchell	Integer Programming: Branch and Cut Algorithms.	Encyclopedia of Optimization	2009	DBLP DOI BibTeX RDF	Integer program, Branch and bound, Exact algorithms, Cutting planes
1	Michael Armbruster, Marzena Fügenschuh, Christoph Helmberg, Alexander Martin	A Comparative Study of Linear and Semidefinite Branch-and-Cut Methods for Solving the Minimum Graph Bisection Problem.	IPCO	2008	DBLP DOI BibTeX RDF	Branch and cut algorithms, semidefinite programs, polyhedral combinatorics, cutting plane algorithms
1	Stefan Ropke, Jean-François Cordeau, Gilbert Laporte	Models and branch-and-cut algorithms for pickup and delivery problems with time windows.	Networks	2007	DBLP DOI BibTeX RDF
1	Sampath Kameshwaran, Lyès Benyoucef, Xiaolan Xie	Branch-and-Cut Algorithms for Winner Determination in Discount Auctions.	Algorithmic Operations Research	2007	DBLP BibTeX RDF
1	Egon Balas, Pierre Bonami	New Variants of Lift-and-Project Cut Generation from the LP Tableau: Open Source Implementation and Testing.	IPCO	2007	DBLP DOI BibTeX RDF	branch and cut algorithms, integer programming
1	Ernst Althaus, Tobias Baumann, Elmar Schömer, Kai Werth	Trunk Packing Revisited.	WEA	2007	DBLP DOI BibTeX RDF	branch and cut algorithms, weighted independent set, approximation algorithms, linear programming, graph algorithms, branch and bound algorithms, packing problems
1	Eduardo Camponogara, Agustinho Plucenio	Lift-gas allocation under precedence constraints: 1-configuration inequalities.	SMC	2007	DBLP DOI BibTeX RDF
1	Markus Chimani, Petra Mutzel, Jens M. Schmidt	Efficient Extraction of Multiple Kuratowski Subdivisions.	Graph Drawing	2007	DBLP DOI BibTeX RDF
1	Markus Chimani, Maria Kandyba, Mike Preuss	Hybrid Numerical Optimization for Combinatorial Network Problems.	Hybrid Metaheuristics	2007	DBLP DOI BibTeX RDF
1	Volker Kaibel, Matthias Peinhardt, Marc E. Pfetsch	Orbitopal Fixing.	IPCO	2007	DBLP DOI BibTeX RDF
1	Éric Duchenne, Gilbert Laporte, Frédéric Semet	Branch-and-cut algorithms for the undirected m.	European Journal of Operational Research	2005	DBLP DOI BibTeX RDF
1	Wilhelm Cronholm, Farid Ajili, Sofia Panagiotidi	On the Minimal Steiner Tree Subproblem and Its Application in Branch-and-Price.	CPAIOR	2005	DBLP DOI BibTeX RDF	preflow-push algorithms, networks, Steiner trees, branch-and-cut
1	Yuji Shinano, Tetsuya Fujie, Yuusuke Kounoike	Effectiveness of Parallelizing the ILOG-CPLEX Mixed Integer Optimizer in the PUBB2 Framework.	Euro-Par	2003	DBLP DOI BibTeX RDF
1	Pablo Rey, Claudia A. Sagastizábal	Convex Normalizations in Lift-and-Project Methods for 0-1 Programming.	Annals OR	2002	DBLP DOI BibTeX RDF	disjunctive cuts, 0-1 integer programming, Branch-and-Cut, cutting planes, Lift-and-Project
1	Matteo Fischetti, Andrea Lodi, Paolo Toth	Solving Real-World ATSP Instances by Branch-and-Cut.	Combinatorial Optimization	2001	DBLP DOI BibTeX RDF
1	Carsten Gutwenger, Michael Jünger, Gunnar W. Klau, Sebastian Leipert, Petra Mutzel, René Weiskircher	AGD: A Library of Algorithms for Graph Drawing.	Graph Drawing	2001	DBLP DOI BibTeX RDF
1	Thomas Christof, Gerhard Reinelt	Algorithmic Aspects of Using Small Instance Relaxations in Parallel Branch-and-Cut.	Algorithmica	2001	DBLP DOI BibTeX RDF
1	Ulrik Brandes, Dorothea Wagner	A Linear Time Algorithm for the Arc Disjoint Menger Problem in Planar Directed Graphs.	Algorithmica	2000	DBLP DOI BibTeX RDF	Combinatorial optimization, Polyhedra, Branch-and-cut
1	Gérard Cornuéjols, Milind Dawande	A Class of Hard Small 0-1 Programs.	IPCO	1998	DBLP DOI BibTeX RDF
1	Lisa Fleischer, Éva Tardos	Separating Maximally Violated Comb Inequalities in Planar Graphs.	IPCO	1996	DBLP DOI BibTeX RDF