scientific article; zbMATH DE number 7124428

Publication date: 30 October 2019

Full work available at URL: http://d-nb.info/985113715/34

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Mixed integer programming (90C11) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)

Related Items

Solving the minimum convex partition of point sets with integer programming, On Generalized Surrogate Duality in Mixed-Integer Nonlinear Programming, Optimal operation of transient gas transport networks, Learning generalized strong branching for set covering, set packing, and 0-1 knapsack problems, DASH: dynamic approach for switching heuristics, A group analysis using the multiregression dynamic models for fMRI networked time series, Generative deep learning for decision making in gas networks, Enhanced branch-cut-and-price algorithm for heterogeneous fleet vehicle routing problems, Vehicle routing with probabilistic capacity constraints, A branch-and-price algorithm for the minimum latency problem, Adapting the \textit{ng}-path relaxation for bike balancing problems, Transferring information across restarts in MIP, Multivariable Branching: A 0-1 Knapsack Problem Case Study, On the Exact Solution of Prize-Collecting Steiner Tree Problems, Integrated Stochastic Optimal Self-Scheduling for Two-Settlement Electricity Markets, Tight convex relaxations for the expansion planning problem, Parallelization of the FICO Xpress-Optimizer, Robust goal programming using different robustness echelons via norm-based and ellipsoidal uncertainty sets, An Exact Method for the Minimum Feedback Arc Set Problem, Cutting plane selection with analytic centers and multiregression, Combinatorial acyclicity models for potential‐based flows, Recycling inequalities for robust combinatorial optimization with budget uncertainty, A Comparative Study of Linear and Semidefinite Branch-and-Cut Methods for Solving the Minimum Graph Bisection Problem, Variable Bound Tightening and Valid Constraints for Multiperiod Blending, Bin Packing Problem with Time Lags, Faster exact solution of sparse maxcut and QUBO problems, Lifting for the integer knapsack cover polyhedron, Solving graph partitioning on sparse graphs: cuts, projections, and extended formulations, Improving energy aware nanosatellite task scheduling by a branch-cut-and-price algorithm, A theoretical and computational analysis of full strong-branching, Efficient presolving methods for the influence maximization problem, Using Two-Dimensional Projections for Stronger Separation and Propagation of Bilinear Terms, A generic exact solver for vehicle routing and related problems, Branch-cut-and-price for scheduling deliveries with time windows in a direct shipping network, On the exact solution of a large class of parallel machine scheduling problems, Efficient presolving methods for solving maximal covering and partial set covering location problems, Adaptive cut selection in mixed-integer linear programming, Feasibility jump: an LP-free Lagrangian MIP heuristic, Safe and Verified Gomory Mixed-Integer Cuts in a Rational Mixed-Integer Program Framework, FiberSCIP—A Shared Memory Parallelization of SCIP, Two-row and two-column mixed-integer presolve using hashing-based pairing methods, An exploratory computational analysis of dual degeneracy in mixed-integer programming, A branch-and-cut algorithm for mixed integer bilevel linear optimization problems and its implementation, Constraint Integer Programming: A New Approach to Integrate CP and MIP, Counting Solutions of Integer Programs Using Unrestricted Subtree Detection, Optimization Bounds from the Branching Dual, Heuristics of the Branch-Cut-and-Price-Framework SCIP, Why Is Maximum Clique Often Easy in Practice?, Nested branch-and-price-and-cut for vehicle routing problems with multiple resource interdependencies, Local search with a SAT oracle for combinatorial optimization, ParaXpress: an experimental extension of the FICO Xpress-Optimizer to solve hard MIPs on supercomputers, SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework, A framework for solving mixed-integer semidefinite programs, Further results on an abstract model for branching and its application to mixed integer programming, Conference scheduling: a clustering-based approach, Mixed-integer programming techniques for the connected max-\(k\)-cut problem, Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning, Three enhancements for optimization-based bound tightening, PAVER 2.0: an open source environment for automated performance analysis of benchmarking data, Rounding and Propagation Heuristics for Mixed Integer Programming, 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, How important are branching decisions: fooling MIP solvers, Implementing the branch-and-cut approach for a general purpose Benders' decomposition framework, Solving linear programs with complementarity constraints using branch-and-cut, Bidirectional labeling for solving vehicle routing and truck driver scheduling problems, Price-and-verify: a new algorithm for recursive circle packing using Dantzig-Wolfe decomposition, Unnamed Item, The maximum diversity assortment selection problem, A computational status update for exact rational mixed integer programming, Implications, conflicts, and reductions for Steiner trees, Structure-driven fix-and-propagate heuristics for mixed integer programming, Advances in verification of ReLU neural networks, On the implementation and strengthening of intersection cuts for QCQPs, A computational status update for exact rational mixed integer programming, Implications, conflicts, and reductions for Steiner trees, Presolve Reductions in Mixed Integer Programming, MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library, Computational aspects of infeasibility analysis in mixed integer programming, Branch-and-Cut Techniques for Solving Realistic Two-Layer Network Design Problems, Conflict Analysis for MINLP, Conflict-Driven Heuristics for Mixed Integer Programming, An enhanced logical benders approach for linear programs with complementarity constraints, An L-shaped method with strengthened lift-and-project cuts, On generalized surrogate duality in mixed-integer nonlinear programming

Uses Software