The following pages link to The Circuit Polytope: Facets (Q4339376):
Displaying 26 items.
- The ring-star problem: a new integer programming formulation and a branch-and-cut algorithm (Q643033) (← links)
- Modelling and solving central cycle problems with integer programming. (Q1427116) (← links)
- Signed orders, choice probabilities, and linear polytopes (Q1598972) (← links)
- On the linear description of the 3-cycle polytope (Q1600839) (← links)
- Circuit and bond polytopes on series-parallel graphs (Q1751117) (← links)
- The Steiner cycle polytope (Q1873013) (← links)
- Locating median cycles in networks (Q1887911) (← links)
- A polyhedral approach to an integer multicommodity flow problem (Q1975361) (← links)
- On solving cycle problems with branch-and-cut: extending shrinking and exact subcycle elimination separation algorithms (Q2241575) (← links)
- A branch-and-cut algorithm for the capacitated profitable tour problem (Q2339836) (← links)
- A stabilized column generation scheme for the traveling salesman subtour problem (Q2433808) (← links)
- Polyhedral combinatorics of the cardinality constrained quadratic knapsack problem and the quadratic selective travelling salesman problem (Q2479572) (← links)
- New techniques for cost sharing in combinatorial optimization games (Q2638367) (← links)
- Upper and lower bounding procedures for the minimum caterpillar spanning problem (Q2840519) (← links)
- Facet Generating Techniques (Q2971603) (← links)
- On the cycle polytope of a directed graph and its relaxations (Q3057102) (← links)
- On the facets and diameter of the<b><i>k</i></b>-cycle polytope (Q3426327) (← links)
- An exact algorithm for solving the ring star problem (Q3553757) (← links)
- The Ring Star Problem: Polyhedral analysis and exact algorithm (Q4474293) (← links)
- On the cycle polytope of a directed graph (Q4509381) (← links)
- Exact Solution Algorithms for the Chordless Cycle Problem (Q5106395) (← links)
- The feasible region for consecutive patterns of permutations is a cycle polytope (Q5918948) (← links)
- Facets of the \(p\)-cycle polytope (Q5946821) (← links)
- A branch and cut approach to the cardinality constrained circuit problem. (Q5957568) (← links)
- Cycle selections (Q6041827) (← links)
- A revisited branch-and-cut algorithm for large-scale orienteering problems (Q6087525) (← links)
