An algorithm for solving fixed-charge problems using surrogate constraints
From MaRDI portal
Recommendations
Cites work
- A branch-and-bound algorithm for solving fixed charge problems
- A computational study of using preprocessing and stronger formulations to solve large general fixed charge problems
- A Heuristic Adjacent Extreme Point Algorithm for the Fixed Charge Problem
- A Mathematical Programming Approach to Editing of Continuous Survey Data
- A New Branch-and-Bound Algorithm for the Fixed-Charge Transportation Problem
- A New Optimization Method for Large Scale Fixed Charge Transportation Problems
- An easy solution for a special class of fixed charge problems
- Concave minimization over a convex polyhedron
- Error Localization for Erroneous Data: Continuous Data, Linear Constraints
- Experiments in integer programming
- scientific article; zbMATH DE number 2166303 (Why is no real title available?)
- Solving Large-Scale Zero-One Linear Programming Problems
- Solving Mixed Integer Programming Problems Using Automatic Reformulation
- Technical Note—A Vertex Ranking Procedure for Solving the Linear Fixed-Charge Problem
- The fixed charge problem
- Valid Linear Inequalities for Fixed Charge Problems
Cited in
(4)- A genetic algorithm for the two-stage supply chain distribution problem associated with a fixed charge
- Surrogate Constraints Algorithm for Reliability Optimization Problems with Multiple Constraints
- scientific article; zbMATH DE number 4147863 (Why is no real title available?)
- MICAI 2004: Advances in Artificial Intelligence
This page was built for publication: An algorithm for solving fixed-charge problems using surrogate constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2638935)