Pages that link to "Item:Q817203"

The following pages link to Projection, lifting and extended formulation integer and combinatorial optimization (Q817203):

Displaying 28 items.

• Integer programming formulations for the elementary shortest path problem (Q322844) (← links)
• Cutting planes from extended LP formulations (Q507316) (← links)
• Modeling disjunctive constraints with a logarithmic number of binary variables and constraints (Q543399) (← links)
• Reformulations for utilizing separability when solving convex MINLP problems (Q721170) (← links)
• Characterization of facets of the hop constrained chain polytope via dynamic programming (Q741741) (← links)
• Quasiconvex minimization on a locally finite union of convex sets (Q956610) (← links)
• Modelling either-or relations in integer programming (Q1026568) (← links)
• The minimum weakly connected independent set problem: polyhedral results and branch-and-cut (Q1751176) (← links)
• Integer programming as projection (Q1751196) (← links)
• A new lift-and-project operator (Q1752818) (← links)
• Identification of unidentified equality constraints for integer programming problems (Q1753456) (← links)
• An integer programming approach for the 2-class single-group classification problem (Q2132360) (← links)
• Ideal, non-extended formulations for disjunctive constraints admitting a network representation (Q2149570) (← links)
• Combinatorial \(n\)-fold integer programming and applications (Q2205969) (← links)
• An analytical comparison of the LP relaxations of integer models for the \(k\)-club problem (Q2255969) (← links)
• The triangle \(k\)-club problem (Q2359790) (← links)
• Polytopes associated with symmetry handling (Q2414904) (← links)
• On the combinatorics of the 2-class classification problem (Q2419359) (← links)
• Unification of lower-bound analyses of the lift-and-project rank of combinatorial optimization polyhedra (Q2462348) (← links)
• Strong valid inequalities for orthogonal disjunctions and bilinear covering sets (Q2638385) (← links)
• Spherical cuts for integer programming problems (Q3499437) (← links)
• Modeling Disjunctive Constraints with a Logarithmic Number of Binary Variables and Constraints (Q3503848) (← links)
• (Q4735936) (← links)
• Exploiting aggregate sparsity in second-order cone relaxations for quadratic constrained quadratic programming problems (Q5038440) (← links)
• Using projected cutting planes in the extended cutting plane method (Q5057972) (← links)
• Using Two-Dimensional Projections for Stronger Separation and Propagation of Bilinear Terms (Q5110560) (← links)
• (Q5743477) (← links)
• Learning physics-based models from data: perspectives from inverse problems and model reduction (Q5887831) (← links)