The mixed vertex packing problem.
From MaRDI portal
Publication:5926330
DOI10.1007/s101070000180zbMath1033.90095MaRDI QIDQ5926330
Nemhauser, George I., Atamtürk, Alper, Savelsbergh, Martin W. P.
Publication date: 18 February 2004
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Integer programming (90C10) Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)
Related Items
On the mixing set with a knapsack constraint, An integer programming approach for linear programs with probabilistic constraints, Branch-and-cut for linear programs with overlapping SOS1 constraints, On the Quantile Cut Closure of Chance-Constrained Problems, Relaxations and approximations of chance constraints under finite distributions, Sparse multi-term disjunctive cuts for the epigraph of a function of binary variables, Chance-Constrained Multiple Bin Packing Problem with an Application to Operating Room Planning, Covering Linear Programming with Violations, On intersection of two mixing sets with applications to joint chance-constrained programs, A polyhedral study on chance constrained program with random right-hand side, New valid inequalities and formulations for the static joint chance-constrained lot-sizing problem, A branch-and-cut decomposition algorithm for solving chance-constrained mathematical programs with finite support, Goal scoring, coherent loss and applications to machine learning, Mixed integer bilevel optimization with a \(k\)-optimal follower: a hierarchy of bounds, Chance-constrained optimization under limited distributional information: a review of reformulations based on sampling and distributional robustness, A branch and bound algorithm for robust binary optimization with budget uncertainty, On mixing sets arising in chance-constrained programming, Sequential pairing of mixed integer inequalities, Valid inequalities for a single constrained 0-1 MIP set intersected with a conflict graph, Convex hull representation of the deterministic bipartite network interdiction problem, On formulations of the stochastic uncapacitated lot-sizing problem, Solving wind farm layout optimization with mixed integer programs and constraint programs, On quantile cuts and their closure for chance constrained optimization problems, A survey of network interdiction models and algorithms, Structure-driven fix-and-propagate heuristics for mixed integer programming, Generalizing 0-1 conflict hypergraphs and mixed conflict graphs: mixed conflict hypergraphs in discrete optimization, Branch-and-cut approaches for chance-constrained formulations of reliable network design problems, Joint chance-constrained programs and the intersection of mixing sets through a submodularity lens, Distributionally robust chance-constrained programs with right-hand side uncertainty under Wasserstein ambiguity, A linear programming approach for linear programs with probabilistic constraints, Nonlinear chance-constrained problems with applications to hydro scheduling
