Practical Solution of Large Mixed Integer Programming Problems with Umpire
From MaRDI portal
Cited in
(37)- A branch and bound algorithm for extreme point mathematical programming problems
- The reduced cost branch and bound algorithm for mixed integer programming
- A heuristic for multiple choice programming
- Experiments in integer programming
- A network solution to a general vehicle scheduling problem
- File allocation involving worst case response times and link capacities: Model and solution procedure
- A branch-and-price algorithm for solving the cutting strips problem
- Branch-and-cut for linear programs with overlapping SOS1 constraints
- A branch-and-bound algorithm for instrumental variable quantile regression
- Heuristic methods and applications: A categorized survey
- Information-based branching schemes for binary linear mixed integer problems
- Faster MIP solutions via new node selection rules
- A note on modeling multiple choice requirements for simple mixed integer programming solvers
- Algorithms and Software for Convex Mixed Integer Nonlinear Programs
- Using branch-and-bound algorithms to obtain suboptimal solutions
- Chance-constrained programming models and approximations for general stochastic bottleneck spanning tree problems
- Strategies for LP-based solving a general class of scheduling problems
- An ideal column algorithm for integer programs with special ordered sets of variables
- Solving large-scale mixed-integer programs with fixed charge variables
- An extremal problem on random trees
- Probability modeling of branch-and-bound method
- An algorithm (GIPC2) for solving integer programming problems with separable nonlinear objective functions
- Global optimization using special ordered sets
- Experiments in mixed-integer linear programming using pseudo-costs
- Solving quadratic assignment problems with rectangular distances and integer programming
- The efficient solution of large-scale linear programming problems—some algorithmic techniques and computational results
- Theoretical comparisons of search strategies in branch-and-bound algorithms
- Mixed integer programming: A historical perspective with Xpress-MP
- Branch and bound, integer, and non-integer programming
- Constraint Integer Programming: A New Approach to Integrate CP and MIP
- An integer programming approach to a class of combinatorial problems
- A theoretical and computational analysis of full strong-branching
- A novel dual-decomposition method for non-convex two-stage stochastic mixed-integer quadratically constrained quadratic problems
- Integer-programming software systems
- Improving the efficiency of the branch and bound algorithm for integer programming based on ``flatness information
- Piecewise-linear approximations of multidimensional functions
- Active-constraint variable ordering for faster feasibility of mixed integer linear programs
This page was built for publication: Practical Solution of Large Mixed Integer Programming Problems with Umpire
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4060731)
