A Heuristic Adjacent Extreme Point Algorithm for the Fixed Charge Problem

Cited in

(32)

Integer linear programming formulation of the material requirements planning problem
A search tree algorithm for plant location problems
A vertex ranking algorithm for the fixed-charge transportation problem
Algorithms for the single-source uncapacitated minimum concave-cost network flow problem
A family of heuristic solution methods for a class of nonlinear programming problems
A solution approach to the fixed charge network flow problem using a dynamic slope scaling procedure
A tabu search heuristic procedure for the fixed charge transportation problem
Solving the fixed charge problem with Lagrangian relaxation and cost allocation heuristics
Facets and algorithms for capacitated lot sizing
A computational study of using preprocessing and stronger formulations to solve large general fixed charge problems
Heuristic methods and applications: A categorized survey
Fixed charge transportation problems: a new heuristic approach based on Lagrangean relaxation and the solving of core problems
Minimum concave-cost network flow problems: Applications, complexity, and algorithms
Exact algorithm for solving a special fixed-charge linear programming problem
COAL: A new heuristic approach for solving the fixed charge problem - computational results
The noncooperative fixed charge transportation problem
Fractional polynomial bounds for the fixed charge problem
Tabu search applied to the general fixed charge problem
A heuristic algorithm for the fixed charge problem
COLE: a new heuristic approach for fixed charge problem computational results
An algorithm for solving fixed-charge problems using surrogate constraints
An aspect of bilevel fixed charge fractional transportation problem
Artificial immune system and sheep flock algorithms for two-stage fixed-charge transportation problem
On lower bounds for the fixed charge problem
Solution approaches for the cutting stock problem with setup cost
A branch-and-bound algorithm for solving a fixed charge problem in the profit optimization of sawn timber production
Minimal-cost network flow problems with variable lower bounds on arc flows
On the pure fixed charge transportation problem
Fixed charge problems with identical fixed charges
In situ column generation for a cutting-stock problem
A heuristic approach for the continuous error localization problem in data cleaning
Use of penalties in a branch and bound procedure for the fixed charge transportation problem

This page was built for publication: A Heuristic Adjacent Extreme Point Algorithm for the Fixed Charge Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4077726)