Experiments in mixed-integer linear programming using pseudo-costs
From MaRDI portal
(Redirected from Publication:4136935)
Cites work
- scientific article; zbMATH DE number 3526452 (Why is no real title available?)
- scientific article; zbMATH DE number 3559281 (Why is no real title available?)
- A tree-search algorithm for mixed integer programming problems
- An Automatic Method of Solving Discrete 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
- On pricing and backward transformation in linear programming
- Pivot selection methods of the Devex LP code
- Practical Solution of Large Mixed Integer Programming Problems with Umpire
- Updated triangular factors of the basis to maintain sparsity in the product form simplex method
Cited in
(24)- 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
- On maintenance scheduling of production units
- A comparative analysis of linear fitting for non-linear functions on optimization. A case study: Air pollution problems
- Representability in mixed integer programming. I: Characterization results
- The efficient solution of large-scale linear programming problems—some algorithmic techniques and computational results
- The best parameter subset using the Chebychev curve fitting criterion
- Heuristic methods and applications: A categorized survey
- Toward unification of exact and heuristic optimization methods
- Learning generalized strong branching for set covering, set packing, and 0-1 knapsack problems
- Learning to branch: generalization guarantees and limits of data-independent discretization
- Optimization Bounds from the Branching Dual
- An ideal column algorithm for integer programs with special ordered sets of variables
- 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
- Solving large-scale mixed-integer programs with fixed charge variables
- Active-constraint variable ordering for faster feasibility of mixed integer linear programs
- SCIP: solving constraint integer programs
- The attractive traveling salesman problem
- Improving strong branching by domain propagation
- Implementations of special ordered sets in MP software
- The reduced cost branch and bound algorithm for mixed integer programming
This page was built for publication: Experiments in mixed-integer linear programming using pseudo-costs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4136935)
