A diving heuristic for mixed-integer problems with unbounded semi-continuous variables

DOI10.1016/J.EJCO.2025.100107MaRDI QIDQ6880273zbMATH OpenFDO

Authors Katrin Halbig, Ambros M. Gleixner, Jakob Witzig, Dieter Weninger

Publication date 19 December 2025

Published in EURO Journal on Computational Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.EJCO.2025.100107

zbMATH Keywords

integer programmingsupply chain managementsemi-continuous variablesindicator constraintsdiving heuristic

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Cites work

• scientific article; zbMATH DE number 3908168 (Why is no real title available?)
• scientific article; zbMATH DE number 6108474 (Why is no real title available?)
• scientific article; zbMATH DE number 7124428 (Why is no real title available?)
• A Computational Study of Search Strategies for Mixed Integer Programming
• A combined variable aggregation presolving technique for mixed integer programming
• A decomposition heuristic for mixed-integer supply chain problems
• A polyhedral study of the semi-continuous knapsack problem
• A tree-search algorithm for mixed integer programming problems
• An Automatic Method of Solving Discrete Programming Problems
• Computer Codes for Problems of Integer Programming
• Conflict-Driven Heuristics for Mixed Integer Programming
• Disjunctive Programming
• Enabling research through the SCIP Optimization Suite 8.0
• Heuristics for convex mixed integer nonlinear programs
• Heuristics of the branch-cut-and-price-framework SCIP
• Integer Programming and Combinatorial Optimization
• Iterative semi-continuous relaxation heuristics for the multiple-choice multidimensional knapsack problem
• Large-Scale Portfolio Optimization
• Local cuts for mixed-integer programming
• Lot sizing with minimum order quantity
• MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library
• Measuring the impact of primal heuristics
• Mixed integer linear programming formulation techniques
• Modelling with integer variables
• On handling indicator constraints in mixed integer programming
• On mathematical programming with indicator constraints
• On the convex hull of the union of certain polyhedra
• Optimal planning in large multi-site production networks
• Polyhedral approaches to mixed integer linear programming
• Preprocessing and Probing Techniques for Mixed Integer Programming Problems
• Presolve Reductions in Mixed Integer Programming
• Recent advances in mathematical programming with semi-continuous variables and cardinality constraint
• Rounding and propagation heuristics for mixed integer programming
• SCIP: solving constraint integer programs
• Semi-continuous network flow problems
• Tackling industrial-scale supply chain problems by mixed-integer programming
• Technical note -- There's no free lunch: on the hardness of choosing a correct big-M in bilevel optimization

This page was built for publication: A diving heuristic for mixed-integer problems with unbounded semi-continuous variables

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6880273)