Continuous Representation Techniques in Combinatorial Optimization (original) (raw)
Related papers
Polyhedral Techniques in Combinatorial Optimization
1995
The Polyhedral-Surface Cutting-Plane Method for Linear Combinatorial Optimization
2020
A Polynomial Time Algorithm for Vertex Enumeration and Optimization over Shaped Partition Polytopes
The Bipartite Boolean Quadric Polytope with Multiple-Choice Constraints
arXiv: Optimization and Control, 2020
Polyhedral Techniques in Combinatorial Optimization II: Applications and Computations
1995
Set operations on polyhedra using binary space partitioning trees
ACM SIGGRAPH Computer Graphics, 1987
A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
Discrete and computational geometry, 1992
New approaches for optimizing over the semimetric polytope
Mathematical Programming, 2005
The use of edge-directions and linear programming to enumerate vertices
Journal of Combinatorial Optimization, 2007
Minimization of Boolean functions by combinatorial method
Technology audit and production reserves, 2017
A New Encoding of Not Necessarily Closed Convex Polyhedra
Delaunay partitions in Rn applied to non-convex programs and vertex/facet enumeration problems
Computers & Operations Research, 2005
Computing compromise sets in polyhedral framework
Applied Mathematics Letters, 2000
Parametric nonlinear discrete optimization over well-described sets and matroid intersections
Mathematical Programming, 2010
On multi-index assignment polytopes
2006
A Discrete Convex Min-Max Formula for Box-TDI Polyhedra
Mathematics of Operations Research
Combinatorial Optimization: An Introduction
Universitext, 2001
A representation of generalized convex polyhedra and applications
Optimization, 2019
The Minimization Method of Boolean Functions in Polynomial Set-theoretical Format
2015
A Faster Cutting Plane Method and its Implications for Combinatorial and Convex Optimization
2015 IEEE 56th Annual Symposium on Foundations of Computer Science, 2015
Piecewise convex formulations of binary and permutation problems
Numerical Analysis and Applications, 2011
On the complete set packing and set partitioning polytopes: Properties and rank 1 facets
Operations Research Letters, 2018
Conic Mixed-Binary Sets: Convex Hull Characterizations and Applications
Operations Research
Discrete Geometry and Optimization
Fields Institute Communications, 2013
Annals of Operations Research, 2012
Boolean operations based on the planar polyhedral representation
Computer-Aided Design, 1988
Foundations of Discrete Optimization: In Transition from Linear to Non-linear Models and Methods
Jahresbericht der Deutschen Mathematiker-Vereinigung, 2012
On the Complexity of Four Polyhedral Set Containment Problems
2011
FPTAS for optimizing polynomials over the mixed-integer points of polytopes in fixed dimension
Mathematical Programming, 2008
An algorithm for discrete booleans with applications to finite element modeling of complex systems
Finite Elements in Analysis and Design, 2013
polymake in Linear and Integer Programming
Combinatorial Optimization with Explicit Delineation of the Ground Set by a Collection of Subsets
SIAM Journal on Discrete Mathematics, 2008
2008
Reduced-size formulations for metric and cut polyhedra in sparse graphs
Networks, 2016
Combinatorial Optimization and Theoretical Computer Science
2008