Mixed Integer Programming: Analyzing 12 Years of Progress
From MaRDI portal
Publication:5265181
DOI10.1007/978-3-642-38189-8_18zbMath1317.90206OpenAlexW83093243MaRDI QIDQ5265181
Roland Wunderling, Tobias Achterberg
Publication date: 22 July 2015
Published in: Facets of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-38189-8_18
Related Items
Improving branch-and-cut performance by random sampling, A Safe Computational Framework for Integer Programming Applied to Chvátal’s Conjecture, Knapsack polytopes: a survey, On Generalized Surrogate Duality in Mixed-Integer Nonlinear Programming, A disjunctive cut strengthening technique for convex MINLP, Compact ILP formulations for the routing and wavelength assignment problem in the design of optical transport networks with regenerators, Learning generalized strong branching for set covering, set packing, and 0-1 knapsack problems, Stochastic Cutting Planes for Data-Driven Optimization, Characterization of the split closure via geometric lifting, A Computational Framework for Solving Nonlinear Binary Optimization Problems in Robust Causal Inference, Bin packing and cutting stock problems: mathematical models and exact algorithms, Building Representative Matched Samples With Multi-Valued Treatments in Large Observational Studies, SelfSplit parallelization for mixed-integer linear programming, Mixed-Integer Convex Representability, An abstract model for branch-and-cut, Learning pseudo-backdoors for mixed integer programs, An Improved Branch-and-Bound Algorithm for the One-Machine Scheduling Problem with Delayed Precedence Constraints, Branch-and-Bound for Biobjective Mixed-Integer Linear Programming, Estimating the Size of Branch-and-Bound Trees, Evolutionary approach for large-scale mine scheduling, Partial hyperplane activation for generalized intersection cuts, A hybrid K-means and integer programming method for commercial territory design: a case study in meat distribution, Optimality-based domain reduction for inequality-constrained NLP and MINLP problems, Preprocessing to reduce the search space: antler structures for feedback vertex set, Parallelization of the FICO Xpress-Optimizer, An abstract model for branching and its application to mixed integer programming, Cutting plane selection with analytic centers and multiregression, Local branching relaxation heuristics for integer linear programs, Learning sparse nonlinear dynamics via mixed-integer optimization, Optimization over decision trees: a case study for the design of stable direct-current electricity networks, Lifting for the integer knapsack cover polyhedron, A data driven Dantzig-Wolfe decomposition framework, A constraint programming approach for the premarshalling problem, Progress in mathematical programming solvers from 2001 to 2020, Using Two-Dimensional Projections for Stronger Separation and Propagation of Bilinear Terms, Adaptive piecewise linear relaxations for enclosure computations for nonconvex multiobjective mixed-integer quadratically constrained programs, Efficient presolving methods for solving maximal covering and partial set covering location problems, Adaptive cut selection in mixed-integer linear programming, A branch and bound algorithm for robust binary optimization with budget uncertainty, Tailored presolve techniques in branch‐and‐bound method for fast mixed‐integer optimal control applications, Domain reduction techniques for global NLP and MINLP optimization, Safe and Verified Gomory Mixed-Integer Cuts in a Rational Mixed-Integer Program Framework, Two-row and two-column mixed-integer presolve using hashing-based pairing methods, Learning in Combinatorial Optimization: What and How to Explore, ParaXpress: an experimental extension of the FICO Xpress-Optimizer to solve hard MIPs on supercomputers, Relational linear programming, A computational study of primal heuristics inside an MI(NL)P solver, Generalized coefficient strengthening cuts for mixed integer programming, Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning, Three enhancements for optimization-based bound tightening, Light robustness in the optimization of Markov decision processes with uncertain parameters, Comparison of the number of nodes explored by cyclic best first search with depth contour and best first search, Preprocessing and cutting planes with conflict graphs, On the geometry of symmetry breaking inequalities, A computational status update for exact rational mixed integer programming, Structure-driven fix-and-propagate heuristics for mixed integer programming, On the geometry of symmetry breaking inequalities, A computational status update for exact rational mixed integer programming, Presolve Reductions in Mixed Integer Programming, A First Implementation of ParaXpress: Combining Internal and External Parallelization to Solve MIPs on Supercomputers, Computational aspects of infeasibility analysis in mixed integer programming, Learn to relax: integrating \(0-1\) integer linear programming with pseudo-Boolean conflict-driven search, Vehicle dispatching plan for minimizing passenger waiting time in a corridor with buses of different sizes: model formulation and solution approaches, Conflict Analysis for MINLP, Conflict-Driven Heuristics for Mixed Integer Programming, Comments on: ``On learning and branching: a survey, An algorithm-independent measure of progress for linear constraint propagation, On generalized surrogate duality in mixed-integer nonlinear programming
Uses Software
