Pages that link to "Item:Q5906949"
From MaRDI portal
The following pages link to Classical cuts for mixed-integer programming and branch-and-cut (Q5906949):
Displaying 16 items.
- On \(t\)-branch split cuts for mixed-integer programs (Q378102) (← links)
- On interval-subgradient and no-good cuts (Q613320) (← links)
- Cutting planes in integer and mixed integer programming (Q697578) (← links)
- Valid inequalities for mixed integer linear programs (Q995784) (← links)
- On degenerate multi-row Gomory cuts (Q1002078) (← links)
- Foundation-penalty cuts for mixed-integer programs. (Q1413909) (← links)
- Theoretical challenges towards cutting-plane selection (Q1650776) (← links)
- An optimality cut for mixed integer linear programs (Q1809846) (← links)
- The rank of (mixed-) integer polyhedra (Q1942280) (← links)
- \(bc\)-\(opt\): A branch-and-cut code for mixed integer programs (Q1961983) (← links)
- Sequential pairing of mixed integer inequalities (Q2471272) (← links)
- Two-stage mean-risk stochastic mixed integer optimization model for location-allocation problems under uncertain environment (Q2666690) (← links)
- Spherical cuts for integer programming problems (Q3499437) (← links)
- Single Straddle Carrier Routing Problem in Port Container Terminals: Mathematical Model and Solving Approaches (Q3627669) (← links)
- (Q4735935) (← links)
- Classical cuts for mixed-integer programming and branch-and-cut (Q5896802) (← links)
