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 50 items.
- On the directed cut cone and polytope (Q281821) (← links)
- Solving disjunctive optimization problems by generalized semi-infinite optimization techniques (Q301738) (← links)
- Lagrangean relaxation of the hull-reformulation of linear generalized disjunctive programs and its use in disjunctive branch and bound (Q323168) (← links)
- Generating cutting planes for the semidefinite relaxation of quadratic programs (Q337405) (← links)
- On the relationship between standard intersection cuts, lift-and-project cuts, and generalized intersection cuts (Q344930) (← links)
- A hierarchy of relaxations for linear generalized disjunctive programming (Q421708) (← links)
- Cardinality constrained combinatorial optimization: complexity and polyhedra (Q429646) (← links)
- Fitting piecewise linear continuous functions (Q439615) (← links)
- Mixed integer linear programming formulations for probabilistic constraints (Q439901) (← links)
- Intersection cuts from multiple rows: a disjunctive programming approach (Q458123) (← links)
- Strong-branching inequalities for convex mixed integer nonlinear programs (Q480939) (← links)
- Modeling disjunctive constraints with a logarithmic number of binary variables and constraints (Q543399) (← links)
- On the separation of disjunctive cuts (Q543404) (← links)
- Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations (Q652290) (← links)
- Higher-level RLT or disjunctive cuts based on a partial enumeration strategy for 0-1 mixed-integer programs (Q691415) (← links)
- Lift-and-project for mixed 0-1 programming: recent progress (Q697568) (← links)
- Mixing polyhedra with two non divisible coefficients (Q715089) (← links)
- Optimum turn-restricted paths, nested compatibility, and optimum convex polygons (Q724738) (← links)
- Stable sets and graphs with no even holes (Q745687) (← links)
- Extension complexity of formal languages (Q778518) (← links)
- \(S\)-hypersimplices, pulling triangulations, and monotone paths (Q783072) (← links)
- Projection, lifting and extended formulation integer and combinatorial optimization (Q817203) (← links)
- Some classes of valid inequalities and convex hull characterizations for dynamic fixed-charge problems under nested constraints (Q817207) (← links)
- Reformulating the disjunctive cut generating linear program (Q827289) (← links)
- A polyhedral view to a generalization of multiple domination (Q832985) (← links)
- MIP reformulations of the probabilistic set covering problem (Q847820) (← links)
- Relaxations of linear programming problems with first order stochastic dominance constraints (Q867928) (← links)
- On optimality and duality theorems of nonlinear disjunctive fractional minmax programs (Q872111) (← links)
- Reverse split rank (Q896287) (← links)
- Simple extensions of polytopes (Q896292) (← links)
- Two-term disjunctions on the second-order cone (Q896297) (← links)
- Convex hulls of superincreasing knapsacks and lexicographic orderings (Q908302) (← links)
- The mixing-MIR set with divisible capacities (Q930344) (← links)
- A study on optimality and duality theorems of nonlinear generalized disjunctive fractional programming (Q949520) (← links)
- Cook, Kannan and Schrijver's example revisited (Q955332) (← links)
- Integral polyhedra related to integer multicommodity flows on a cycle (Q968136) (← links)
- Multi-step methods for choosing the best set of variables in regression analysis (Q989838) (← links)
- Valid inequalities for mixed integer linear programs (Q995784) (← links)
- A compact formulation of the ring loading problem with integer demand splitting (Q1015309) (← links)
- On the polyhedral lift-and-project methods and the fractional stable set polytope (Q1015326) (← links)
- Using rank-1 lift-and-project closures to generate cuts for 0-1 MIPs, a computational investigation (Q1019294) (← links)
- Modelling either-or relations in integer programming (Q1026568) (← links)
- A simplification for some disjunctive formulations (Q1104856) (← links)
- Strengthening cuts for mixed integer programs (Q1142702) (← links)
- A finitely convergent procedure for facial disjunctive programs (Q1159568) (← links)
- An algorithm for disjunctive programs (Q1173796) (← links)
- A note on duality in disjunctive programming (Q1229803) (← links)
- The splitting of variables and constraints in the formulation of integer programming models (Q1278148) (← links)
- An alternative explanation of disjunctive formulations (Q1319581) (← links)
- A modified lift-and-project procedure (Q1365045) (← links)
