Pages that link to "Item:Q1612003"

The following pages link to Compact vs. exponential-size LP relaxations (Q1612003):

Displaying 18 items.

• New formulations of the multiple sequence alignment problem (Q628651) (← links)
• A time-indexed LP-based approach for min-sum job-shop problems (Q646647) (← links)
• Characterization of facets of the hop constrained chain polytope via dynamic programming (Q741741) (← links)
• New tighter polynomial length formulations for the asymmetric traveling salesman problem with and without precedence constraints (Q1886799) (← links)
• Learning to classify with missing and corrupted features (Q1959617) (← links)
• A class of lifted path and flow-based formulations for the asymmetric traveling salesman problem with and without precedence constraints (Q2494810) (← links)
• A branch-and-cut algorithm for multiple sequence alignment (Q2583133) (← links)
• Mixed Integer Linear Programming Formulation Techniques (Q2808240) (← links)
• An effective compact formulation of the max cut problem on sparse graphs (Q2840693) (← links)
• DC Programming and DCA for Challenging Problems in Bioinformatics and Computational Biology (Q4983006) (← links)
• On Fault-Tolerant Low-Diameter Clusters in Graphs (Q5060794) (← links)
• Integer Programming Formulations for Minimum Spanning Tree Interdiction (Q5084609) (← links)
• Deriving compact extended formulations via LP-based separation techniques (Q5892024) (← links)
• A new integer programming formulation of the graphical traveling salesman problem (Q5918436) (← links)
• Deriving compact extended formulations via LP-based separation techniques (Q5925168) (← links)
• A new integer programming formulation of the graphical traveling salesman problem (Q5925646) (← links)
• An extended formulation for the 1‐wheel inequalities of the stable set polytope (Q6068534) (← links)
• Solving graph partitioning on sparse graphs: cuts, projections, and extended formulations (Q6102859) (← links)