Pages that link to "Item:Q1281382"
From MaRDI portal
The following pages link to Disjunctive programming: Properties of the convex hull of feasible points (Q1281382):
Displaying 17 items.
- Strong mixed-integer programming formulations for trained neural networks (Q5918909) (← links)
- Relaxations of mixed integer sets from lattice-free polyhedra (Q5925161) (← links)
- Lifting convex inequalities for bipartite bilinear programs (Q5925639) (← links)
- Set covering heuristics in a benders decomposition for railway timetabling (Q6047880) (← links)
- A linear programming based approach to the Steiner tree problem with a fixed number of terminals (Q6068538) (← links)
- Shadows of Newton polytopes (Q6076195) (← links)
- Modeling combinatorial disjunctive constraints via junction trees (Q6120845) (← links)
- Service center location problems with decision dependent utilities and a pandemic case study (Q6150220) (← links)
- Convex mixed-integer nonlinear programs derived from generalized disjunctive programming using cones (Q6498414) (← links)
- Circuits in extended formulations (Q6564188) (← links)
- Mathematical programming for simultaneous feature selection and outlier detection under l1 norm (Q6565451) (← links)
- Sparse multi-term disjunctive cuts for the epigraph of a function of binary variables (Q6589754) (← links)
- MIP relaxations in factorable programming (Q6601201) (← links)
- Relaxations and cutting planes for linear programs with complementarity constraints (Q6607018) (← links)
- A polynomial-size extended formulation for the multilinear polytope of beta-acyclic hypergraphs (Q6608035) (← links)
- A disjunctive cutting plane algorithm for bilinear programming (Q6622752) (← links)
- Facet separation for disjunctive constraints with network flow representation (Q6644361) (← links)
