Search results for "polyhedral combinatorics"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
2	Vicky Mak, Tommy Thomadsen	Polyhedral combinatorics of the cardinality constrained quadratic knapsack problem and the quadratic selective travelling salesman problem.	J. Comb. Optim.	2006	DBLP DOI BibTeX RDF	Quadratic knapsack, Quadratic selective travelling salesman, Polyhedral analysis, Facets
2	Marcus Oswald, Gerhard Reinelt, Dirk Oliver Theis	Not Every GTSP Facet Induces an STSP Facet.	IPCO	2005	DBLP DOI BibTeX RDF	Graphical Traveling Salesman Problem, Symmetric Traveling Salesman Problem, polyhedral computation, facets, polyhedral combinatorics
2	Ioannis Z. Emiris, Kyriakos Zervoudakis	Successive Linear Programs for Computing All Integral Points in a Minkowski Sum.	Panhellenic Conference on Informatics	2005	DBLP DOI BibTeX RDF	integral points, linear programming, Minkowski sum, polyhedral combinatorics, convex polytope, duality theory
2	I. R. de Farias	Semi-continuous Cuts for Mixed-Integer Programming.	IPCO	2004	DBLP DOI BibTeX RDF	semi-continuous variables, mixed-integer programming, branch-and-cut, polyhedral combinatorics, disjunctive programming
2	Andrew J. Miller, George L. Nemhauser, Martin W. P. Savelsbergh	Facets, Algorithms, and Polyhedral Characterizations for a Multi-item Production Planning Model with Setup Times.	IPCO	2001	DBLP DOI BibTeX RDF	capacitated lot-sizing, fixed charge network flow, Mixed integer programming, polyhedral combinatorics, production planning, setup times
1	László Csirmaz, Péter Ligeti	On an infinite family of graphs with information ratio 2 - 1/k.	Computing	2009	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 94A60, 94A17
1	M. K. Kravtsov, E. V. Lukshin	Polyhedral combinatorics of multi-index axial transportation problems.	European Journal of Operational Research	2008	DBLP DOI BibTeX RDF
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	Adam N. Letchford, Michael M. Sørensen	Binary Positive Semidefinite Matrices and Associated Integer Polytopes.	IPCO	2008	DBLP DOI BibTeX RDF	semidefinite programming, Polyhedral combinatorics
1	Gérard Cornuéjols	Review of combinatorial optimization: packing and covering.	SIGACT News	2008	DBLP DOI BibTeX RDF
1	Meinolf Sellmann, Luc Mercier, Daniel H. Leventhal	The Linear Programming Polytope of Binary Constraint Problems with Bounded Tree-Width.	CPAIOR	2007	DBLP DOI BibTeX RDF	integer programming, constraint programming, cutting planes, polyhedral combinatorics
1	Sanjeeb Dash, Ricardo Fukasawa, Oktay Günlük	On a Generalization of the Master Cyclic Group Polyhedron.	IPCO	2007	DBLP DOI BibTeX RDF	integer programming, polyhedral combinatorics
1	Retsef Levi, Andrea Lodi, Maxim Sviridenko	Approximation Algorithms for the Multi-item Capacitated Lot-Sizing Problem Via Flow-Cover Inequalities.	IPCO	2007	DBLP DOI BibTeX RDF	scheduling theory and algorithms, approximation algorithms, integer programming, randomized algorithms, polyhedral combinatorics
1	Javier Marenco, Annegret Wagler	Chromatic scheduling polytopes coming from the bandwidth allocation problem in point-to-multipoint radio access systems.	Annals OR	2007	DBLP DOI BibTeX RDF	Bandwidth allocation, Polyhedral combinatorics
1	Matthias Jach, Matthias Köppe, Robert Weismantel	Nondecomposable solutions to group equations and an application to polyhedral combinatorics.	4OR	2006	DBLP DOI BibTeX RDF	Gomory corner polyhedron, irreducible group solutions, simultaneous lifting
1	Angel Corberán, Isaac Plana, José M. Sanchis	Zigzag inequalities: a new class of facet-inducing inequalities for Arc Routing Problems.	Math. Program.	2006	DBLP DOI BibTeX RDF	Windy Rural Postman Problem, Windy General Routing Problem, Mixed Rural Postman Problem, Facets, Polyhedral Combinatorics, Arc Routing
1	Monia Giandomenico, Adam N. Letchford	Exploring the Relationship Between Max-Cut and Stable Set Relaxations.	Math. Program.	2006	DBLP DOI BibTeX RDF	Stable set problem, Polyhedral combinatorics, Max-cut problem
1	Francesco Maffioli	In: Alexander Schrijver, Editors, Combinatorial Optimization-Polyhedra and Efficiency or All You Wanted to Know about Polyhedral Combinatorics and Never Dared to Ask.	European Journal of Operational Research	2005	DBLP DOI BibTeX RDF
1	Tamás Kis	A branch-and-cut algorithm for scheduling of projects with variable-intensity activities.	Math. Program.	2005	DBLP DOI BibTeX RDF	Network flows, Branch-and-cut, Project scheduling, Polyhedral combinatorics
1	Michelangelo Conforti, Romeo Rizzi	Combinatorial optimization - Polyhedra and efficiency: A book review.	4OR	2004	DBLP DOI BibTeX RDF	Combinatorial optimization, integer programming, polyhedral combinatorics
1	Michael Malmros Sørensen	b-Tree Facets for the Simple Graph Partitioning Polytope.	J. Comb. Optim.	2004	DBLP DOI BibTeX RDF	clustering, graph partitioning, polyhedral combinatorics, multicuts
1	Julie Christophe, Jean-Paul Doignon, Samuel Fiorini	The Biorder Polytope.	Order	2004	DBLP DOI BibTeX RDF	biorder, stability-critical graph, polytope, polyhedral combinatorics
1	Francisco Santos	Triangulations of polytopes and algebraic geometry.	ISSAC	2004	DBLP DOI BibTeX RDF	toric Hilbert scheme, tropical geometry
1	Roger Z. Ríos-Mercado, Jonathan F. Bard	The Flow Shop Scheduling Polyhedron with Setup Time.	J. Comb. Optim.	2003	DBLP DOI BibTeX RDF	facet-defining inequalities, polyhedral combinatorics, setup times, flow shop scheduling, asymmetric traveling salesman problem, linear ordering problem
1	Ernst Althaus, Alberto Caprara, Hans-Peter Lenhof, Knut Reinert	Multiple sequence alignment with arbitrary gap costs: Computing an optimal solution using polyhedral combinatorics.	ECCB	2002	DBLP BibTeX RDF
1	Volker Kaibel	Polyhedral Combinatorics of Quadratic Assignment Problems with Less Objects than Locations.	IPCO	1998	DBLP DOI BibTeX RDF
1	Hernán G. Abeledo, Gary W. Atkinson	Polyhedral Combinatorics of Benzenoid Problems.	IPCO	1998	DBLP DOI BibTeX RDF
1	Petra Mutzel, René Weiskircher	Two-Layer Planarization in Graph Drawing.	ISAAC	1998	DBLP DOI BibTeX RDF
1	Geir Dahl	Polyhedra and Optimization in Connection with a Weak Majorization Ordering.	IPCO	1995	DBLP DOI BibTeX RDF	polyhedral combinatorics, Majorization
1	Kazuo Murota	Combinatorial relaxation algorithm for the maximum degree of subdeterminants: Computing Smith-Mcmillan form at infinity and structural indices in Kronecker form.	Appl. Algebra Eng. Commun. Comput.	1995	DBLP DOI BibTeX RDF	combinatorial matrix theory, Kronecker form of matrix pencil, Smith-McMillan form of rational matrix, matching, determinant, computer algebra, polyhedral combinatorics
1	Dimitris Bertsimas	The achievable region method in the optimal control of queueing systems; formulations, bounds and policies.	Queueing Syst.	1995	DBLP DOI BibTeX RDF	multiarmed bandits, optimization, policies, Queueing networks, bounds, loss networks
1	Andrew H. Gee, Richard W. Prager	Polyhedral Combinatorics and Neural Networks.	Neural Computation	1994	DBLP DOI BibTeX RDF