Experiments in mixed-integer linear programming
From MaRDI portal
Cites work
Cited in
(66)- From feasibility to improvement to proof: three phases of solving mixed-integer programs
- Convex envelopes of bounded monomials on two-variable cones
- Computational study of a branching algorithm for the maximum \(k\)-cut problem
- Measuring the impact of branching rules for mixed-integer programming
- Faster MIP solutions via new node selection rules
- A theoretical and computational analysis of full strong-branching
- Solving linear programs with complementarity constraints using branch-and-cut
- Hybrid method for linear programming
- Spatial branching for a special class of convex MIQO problems
- Branching from the largest upper bound. Folklore and facts
- On learning and branching: a survey
- The impact of filtering in a branch-and-cut algorithm for multicommodity capacitated fixed charge network design
- A comparative analysis of linear fitting for non-linear functions on optimization. A case study: Air pollution problems
- Experiments in mixed-integer linear programming using pseudo-costs
- Solving convex MINLP optimization problems using a sequential cutting plane algorithm
- Last fifty years of integer linear programming: a focus on recent practical advances
- On generalized surrogate duality in mixed-integer nonlinear programming
- An algorithmic framework for convex mixed integer nonlinear programs
- A computational study of parametric tabu search for 0-1 mixed integer programs
- Investigation of some branch and bound strategies for the solution of mixed integer linear programs
- Further results on an abstract model for branching and its application to mixed integer programming
- Experiments with conflict analysis in mixed integer programming
- Information-theoretic approaches to branching in search
- The leave-worst-k-out criterion for cross validation
- Evaluating the impact of AND/OR search on 0-1 integer linear programming
- The efficient solution of large-scale linear programming problems—some algorithmic techniques and computational results
- Integer-programming software systems
- Theoretical comparisons of search strategies in branch-and-bound algorithms
- A branch-and-bound algorithm for a class of mixed integer linear maximum multiplicative programs: a bi-objective optimization approach
- Progressively strengthening and tuning MIP solvers for reoptimization
- Improved penalty calculations for a mixed integer branch-and-bound algorithm
- Accelerating the B\&B algorithm for integer programming based on flatness information: an approach applied to the multidimensional knapsack problem
- Branching on nonchimerical fractionalities
- Trivial integer programs unsolvable by branch-and-bound
- A combinatorial branch-and-bound algorithm for box search
- Toward unification of exact and heuristic optimization methods
- Learning generalized strong branching for set covering, set packing, and 0-1 knapsack problems
- Branching rules revisited
- Learning to branch: generalization guarantees and limits of data-independent discretization
- Optimization Bounds from the Branching Dual
- Achieving MILP feasibility quickly using general disjunctions
- Adaptive large neighborhood search for mixed integer programming
- A novel dual-decomposition method for non-convex two-stage stochastic mixed-integer quadratically constrained quadratic problems
- Disjunctive Cuts for Nonconvex MINLP
- A continuous approach to nonlinear integer programming
- Artificial intelligence for optimization: unleashing the potential of parameter generation, model formulation, and solution methods
- Multivariable Branching: A 0-1 Knapsack Problem Case Study
- Analisis de estrategias en el ajuste lineal de funciones no-lineales en problemas de optimizacion
- Improving the efficiency of the branch and bound algorithm for integer programming based on ``flatness information
- COVID-19: metaheuristic optimization-based forecast method on time-dependent bootstrapped data
- Solving large-scale mixed-integer programs with fixed charge variables
- The stochastic transportation problem with single sourcing
- Transferring information across restarts in MIP
- Active-constraint variable ordering for faster feasibility of mixed integer linear programs
- SCIP: solving constraint integer programs
- Algorithms and Software for Convex Mixed Integer Nonlinear Programs
- Decomposition Branching for Mixed Integer Programming
- A Penalty Branch-and-Bound Method for Mixed Binary Linear Complementarity Problems
- Improving strong branching by domain propagation
- SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework
- Branch-and-cut-and-price for the cardinality-constrained multi-cycle problem in kidney exchange
- A Branch-Price-and-Cut Procedure for the Discrete Ordered Median Problem
- Information-based branching schemes for binary linear mixed integer problems
- Backdoor branching
- Efficient neural network analysis with sum-of-infeasibilities
- Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning
This page was built for publication: Experiments in mixed-integer linear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5642449)
