Exact algorithm for solving a special fixed-charge linear programming problem
From MaRDI portal
Publication:2277362
Cites work
- scientific article; zbMATH DE number 4089320 (Why is no real title available?)
- scientific article; zbMATH DE number 3791939 (Why is no real title available?)
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- scientific article; zbMATH DE number 3594862 (Why is no real title available?)
- scientific article; zbMATH DE number 3286663 (Why is no real title available?)
- A Heuristic Adjacent Extreme Point Algorithm for the Fixed Charge Problem
- A SIMPLEX PROCEDURE FOR A FIXED CHARGE PROBLEM
- A branch-and-bound algorithm for solving a fixed charge problem in the profit optimization of sawn timber production
- A branch-and-bound algorithm for solving fixed charge problems
- An approximate solution method for the fixed charge problem
- An approximative algorithm for the fixed charge problem
- An efficient algorithm for solving fixed charge problems
- Fixed-cost transportation problems
- Improved Penalties for Fixed Cost Linear Programs Using Lagrangean Relaxation
- Scheduling of power generation via large-scale nonlinear optimization
- The fixed charge problem
Cited in
(4)
This page was built for publication: Exact algorithm for solving a special fixed-charge linear programming problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2277362)