Pages that link to "Item:Q5957568"

The following pages link to A branch and cut approach to the cardinality constrained circuit problem. (Q5957568):

Displaying 17 items.

• Integer programming formulations for the elementary shortest path problem (Q322844) (← links)
• On the kidney exchange problem: cardinality constrained cycle and chain problems on directed graphs: a survey of integer programming approaches (Q512864) (← links)
• A complete characterization of jump inequalities for the hop-constrained shortest path problem (Q528561) (← links)
• Characterization of facets of the hop constrained chain polytope via dynamic programming (Q741741) (← links)
• On cardinality constrained cycle and path polytopes (Q964176) (← links)
• Facets of the \((s,t)-p\)-path polytope (Q967368) (← links)
• On the linear description of the 3-cycle polytope (Q1600839) (← links)
• A polyhedral study of the cardinality constrained multi-cycle and multi-chain problem on directed graphs (Q1654342) (← links)
• Circuit and bond polytopes on series-parallel graphs (Q1751117) (← 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)
• Polyhedral combinatorics of the cardinality constrained quadratic knapsack problem and the quadratic selective travelling salesman problem (Q2479572) (← links)
• Projection results for vehicle routing (Q2583125) (← links)
• Exact Solution Algorithms for the Chordless Cycle Problem (Q5106395) (← links)
• Facets of the \(p\)-cycle polytope (Q5946821) (← links)
• Cycle selections (Q6041827) (← links)
• The multi‐depot family traveling salesman problem and clustered variants: Mathematical formulations and branch‐&‐cut based methods (Q6085888) (← links)