Pages that link to "Item:Q4742231"
From MaRDI portal
The following pages link to On Linear Characterizations of Combinatorial Optimization Problems (Q4742231):
Displayed 30 items.
- Facets of the clique partitioning polytope (Q752015) (← links)
- Recent trends in combinatorial optimization (Q788638) (← links)
- Optimizing over the subtour polytope of the travelling salesman problem (Q803048) (← links)
- Large-scale semidefinite programs in electronic structure calculation (Q868461) (← links)
- The stable set polytope of quasi-line graphs (Q949780) (← links)
- Bidimensional packing by bilinear programming (Q1016113) (← links)
- Polyhedral proof methods in combinatorial optimization (Q1082268) (← links)
- Probabilistic satisfiability (Q1104751) (← links)
- The complexity of lifted inequalities for the knapsack problem (Q1201098) (← links)
- On approximately fair cost allocation in Euclidean TSP games (Q1384221) (← links)
- A polyhedral approach to sequence alignment problems (Q1585327) (← links)
- Optimization with additional variables and constraints (Q1779712) (← links)
- Facets and algorithms for capacitated lot sizing (Q1823857) (← links)
- Valid inequalities and separation for mixed 0-1 constraints with variable upper bounds (Q1824557) (← links)
- A polyhedron with all \(s-t\) cuts as vertices, and adjacency of cuts (Q1904657) (← links)
- Persistency of linear programming relaxations for the stable set problem (Q2118136) (← links)
- A linear programming primer: from Fourier to Karmarkar (Q2177789) (← links)
- Probabilistic existence of regular combinatorial structures (Q2400828) (← links)
- Facet-defining inequalities for the simple graph partitioning polytope (Q2467133) (← links)
- (Q2861492) (← links)
- Complexity of column generation in network design with path-based survivability mechanisms (Q2892152) (← links)
- Parameterized Weighted Containment (Q2946752) (← links)
- Sensitivity theorems in integer linear programming (Q3793940) (← links)
- The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization (Q4789079) (← links)
- The Branch and Cut Method for the Clique Partitioning Problem (Q4973260) (← links)
- Persistency of Linear Programming Relaxations for the Stable Set Problem (Q5041757) (← links)
- The Boolean Quadric Polytope (Q5050144) (← links)
- On the Composition of Convex Envelopes for Quadrilinear Terms (Q5244679) (← links)
- Ranking Functions for Linear-Constraint Loops (Q5501930) (← links)
- On cycle cones and polyhedra (Q5895283) (← links)