Experiments in mixed-integer linear programming using pseudo-costs
From MaRDI portal
Publication:4136935
DOI10.1007/BF01593767zbMath0362.90070OpenAlexW2016815536MaRDI QIDQ4136935
J.-M. Gauthier, Gerard Ribiere
Publication date: 1977
Published in: Mathematical Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01593767
Related Items
The reduced cost branch and bound algorithm for mixed integer programming, Representability in mixed integer programming. I: Characterization results, Learning generalized strong branching for set covering, set packing, and 0-1 knapsack problems, Improving the efficiency of the branch and bound algorithm for integer programming based on ``flatness information, Multivariable Branching: A 0-1 Knapsack Problem Case Study, A theoretical and computational analysis of full strong-branching, On maintenance scheduling of production units, Optimization Bounds from the Branching Dual, Faster MIP solutions via new node selection rules, Active-constraint variable ordering for faster feasibility of mixed integer linear programs, Measuring the Impact of Branching Rules for Mixed-Integer Programming, The efficient solution of large-scale linear programming problems—some algorithmic techniques and computational results, Improving strong branching by domain propagation, SCIP: solving constraint integer programs, A comparative analysis of linear fitting for non-linear functions on optimization. A case study: Air pollution problems, Analisis de estrategias en el ajuste lineal de funciones no-lineales en problemas de optimizacion, Heuristic methods and applications: A categorized survey, The attractive traveling salesman problem, The best parameter subset using the Chebychev curve fitting criterion, Toward unification of exact and heuristic optimization methods, An ideal column algorithm for integer programs with special ordered sets of variables, Implementations of special ordered sets in MP software, Solving large-scale mixed-integer programs with fixed charge variables
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- An Automatic Method of Solving Discrete Programming Problems
- Practical Solution of Large Mixed Integer Programming Problems with Umpire
- On pricing and backward transformation in linear programming
- Updated triangular factors of the basis to maintain sparsity in the product form simplex method
- A tree-search algorithm for mixed integer programming problems
- Direct Search Algorithms for Zero-One and Mixed-Integer Programming
- Experiments in mixed-integer linear programming
- Integer Programming Algorithms: A Framework and State-of-the-Art Survey
- Pivot selection methods of the Devex LP code
