The following pages link to The mixed vertex packing problem. (Q5926330):
Displaying 31 items.
- On the mixing set with a knapsack constraint (Q291057) (← links)
- A branch-and-cut decomposition algorithm for solving chance-constrained mathematical programs with finite support (Q403644) (← links)
- Branch-and-cut approaches for chance-constrained formulations of reliable network design problems (Q744205) (← links)
- An integer programming approach for linear programs with probabilistic constraints (Q847852) (← links)
- Branch-and-cut for linear programs with overlapping SOS1 constraints (Q1646682) (← links)
- Relaxations and approximations of chance constraints under finite distributions (Q1650766) (← links)
- A polyhedral study on chance constrained program with random right-hand side (Q1683680) (← links)
- Valid inequalities for a single constrained 0-1 MIP set intersected with a conflict graph (Q1751163) (← links)
- On quantile cuts and their closure for chance constrained optimization problems (Q1801023) (← links)
- Generalizing 0-1 conflict hypergraphs and mixed conflict graphs: mixed conflict hypergraphs in discrete optimization (Q2046309) (← links)
- Joint chance-constrained programs and the intersection of mixing sets through a submodularity lens (Q2089774) (← links)
- Distributionally robust chance-constrained programs with right-hand side uncertainty under Wasserstein ambiguity (Q2097654) (← links)
- Nonlinear chance-constrained problems with applications to hydro scheduling (Q2118083) (← links)
- Sparse multi-term disjunctive cuts for the epigraph of a function of binary variables (Q2164683) (← links)
- Goal scoring, coherent loss and applications to machine learning (Q2191765) (← links)
- Convex hull representation of the deterministic bipartite network interdiction problem (Q2248756) (← links)
- A survey of network interdiction models and algorithms (Q2294622) (← links)
- Structure-driven fix-and-propagate heuristics for mixed integer programming (Q2295978) (← links)
- A linear programming approach for linear programs with probabilistic constraints (Q2356018) (← links)
- On intersection of two mixing sets with applications to joint chance-constrained programs (Q2414899) (← links)
- On mixing sets arising in chance-constrained programming (Q2429465) (← links)
- Sequential pairing of mixed integer inequalities (Q2471272) (← links)
- On formulations of the stochastic uncapacitated lot-sizing problem (Q2494816) (← links)
- Solving wind farm layout optimization with mixed integer programs and constraint programs (Q2513750) (← links)
- Covering Linear Programming with Violations (Q2940540) (← links)
- On the Quantile Cut Closure of Chance-Constrained Problems (Q3186519) (← links)
- Chance-Constrained Multiple Bin Packing Problem with an Application to Operating Room Planning (Q5084621) (← links)
- New valid inequalities and formulations for the static joint chance-constrained lot-sizing problem (Q6038656) (← links)
- Mixed integer bilevel optimization with a \(k\)-optimal follower: a hierarchy of bounds (Q6102856) (← links)
- Chance-constrained optimization under limited distributional information: a review of reformulations based on sampling and distributional robustness (Q6114933) (← links)
- A branch and bound algorithm for robust binary optimization with budget uncertainty (Q6175705) (← links)
