AbstractMany combinatorial optimization problems call for the optimization of a linear function over a certain polytope. Typically, these polytopes have an exponential number of facets. We explore the problem of finding small linear programming formulations when one may use any new variables and constraints. We show that expressing the matching and the Traveling Salesman Problem by a symmetric linear program requires exponential size. We relate the minimum size needed by a LP to express a polytope to a combinatorial parameter, point out some connections with communication complexity theory, and examine the vertex packing polytope for some classes of graphs
This survey is concerned with the size of perfect formulations for combinatorial optimization proble...
Linear programming (LP) and semidefinite programming (SDP) are among the most important tools in Ope...
We solve a 20-year old problem posed by Yannakakis and prove that there exists no polynomial-size li...
AbstractMany combinatorial optimization problems call for the optimization of a linear function over...
We solve a 20-year old problem posed by Yannakakis and prove that there exists no polynomial-size li...
We solve a 20-year old problem posed by Yannakakis and prove that no polynomial-size linear program ...
Linear and semidefinite programs are fundamental algorithmic tools, often providing conjecturallyopt...
We prove that there are 0/1 polytopes P⊆R[superscript n] that do not admit a compact LP formulation...
Combinatorial optimization plays a central role in complexity theory, operations research, and algor...
Combinatorial optimization problems appear in many disciplines ranging from management and logistic...
© 2019 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for a...
We prove exponential lower bounds on the running time of Dynamic Programs (DP) of a certain class fo...
In this thesis we give new algorithms for two fundamental graph problems. We develop novel ways of u...
Hard combinatorial optimization problems are often approximated using linear or semidefinite program...
Combinatorial optimization problems appear in many disciplines ranging from management and logistics...
This survey is concerned with the size of perfect formulations for combinatorial optimization proble...
Linear programming (LP) and semidefinite programming (SDP) are among the most important tools in Ope...
We solve a 20-year old problem posed by Yannakakis and prove that there exists no polynomial-size li...
AbstractMany combinatorial optimization problems call for the optimization of a linear function over...
We solve a 20-year old problem posed by Yannakakis and prove that there exists no polynomial-size li...
We solve a 20-year old problem posed by Yannakakis and prove that no polynomial-size linear program ...
Linear and semidefinite programs are fundamental algorithmic tools, often providing conjecturallyopt...
We prove that there are 0/1 polytopes P⊆R[superscript n] that do not admit a compact LP formulation...
Combinatorial optimization plays a central role in complexity theory, operations research, and algor...
Combinatorial optimization problems appear in many disciplines ranging from management and logistic...
© 2019 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for a...
We prove exponential lower bounds on the running time of Dynamic Programs (DP) of a certain class fo...
In this thesis we give new algorithms for two fundamental graph problems. We develop novel ways of u...
Hard combinatorial optimization problems are often approximated using linear or semidefinite program...
Combinatorial optimization problems appear in many disciplines ranging from management and logistics...
This survey is concerned with the size of perfect formulations for combinatorial optimization proble...
Linear programming (LP) and semidefinite programming (SDP) are among the most important tools in Ope...
We solve a 20-year old problem posed by Yannakakis and prove that there exists no polynomial-size li...