Practical Solution of Large Mixed Integer Programming Problems with Umpire
From MaRDI portal
Publication:4060731
DOI10.1287/mnsc.20.5.736zbMath0304.90079OpenAlexW2117470170MaRDI QIDQ4060731
No author found.
Publication date: 1974
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/mnsc.20.5.736
Related Items
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, Algorithms and Software for Convex Mixed Integer Nonlinear Programs, Branch-and-cut for linear programs with overlapping SOS1 constraints, Chance-Constrained Programming Models and Approximations for General Stochastic Bottleneck Spanning Tree Problems, Improving the efficiency of the branch and bound algorithm for integer programming based on ``flatness information, Strategies for LP-based solving a general class of scheduling problems, A branch-and-price algorithm for solving the cutting strips problem, Experiments in integer programming, A theoretical and computational analysis of full strong-branching, A branch-and-bound algorithm for instrumental variable quantile regression, An integer programming approach to a class of combinatorial problems, Constraint Integer Programming: A New Approach to Integrate CP and MIP, Global optimization using special ordered sets, Mixed integer programming: A historical perspective with Xpress-MP, Branch and bound, integer, and non-integer programming, Piecewise-linear approximations of multidimensional functions, Experiments in mixed-integer linear programming using pseudo-costs, Using branch-and-bound algorithms to obtain suboptimal solutions, Information-based branching schemes for binary linear mixed integer problems, Faster MIP solutions via new node selection rules, Active-constraint variable ordering for faster feasibility of mixed integer linear programs, Solving quadratic assignment problems with rectangular distances and integer programming, A network solution to a general vehicle scheduling problem, The efficient solution of large-scale linear programming problems—some algorithmic techniques and computational results, File allocation involving worst case response times and link capacities: Model and solution procedure, Theoretical comparisons of search strategies in branch-and-bound algorithms, Heuristic methods and applications: A categorized survey, An extremal problem on random trees, A note on modeling multiple choice requirements for simple mixed integer programming solvers, An ideal column algorithm for integer programs with special ordered sets of variables, Solving large-scale mixed-integer programs with fixed charge variables, Probability modeling of branch-and-bound method, Integer-programming software systems, An algorithm (GIPC2) for solving integer programming problems with separable nonlinear objective functions
