A Heuristic Adjacent Extreme Point Algorithm for the Fixed Charge Problem
From MaRDI portal
Publication:4077726
DOI10.1287/mnsc.22.5.587zbMath0316.90041OpenAlexW2021069399MaRDI QIDQ4077726
Publication date: 1976
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/278fe1d5327e4886562f4d21c0d0ed27d5a4afc8
Related Items
Tabu search applied to the general fixed charge problem, An algorithm for solving fixed-charge problems using surrogate constraints, On lower bounds for the fixed charge problem, Solution approaches for the cutting stock problem with setup cost, Artificial immune system and sheep flock algorithms for two-stage fixed-charge transportation problem, In situ column generation for a cutting-stock problem, A heuristic approach for the continuous error localization problem in data cleaning, An aspect of bilevel fixed charge fractional transportation problem, Integer linear programming formulation of the material requirements planning problem, A search tree algorithm for plant location problems, A heuristic algorithm for the fixed charge problem, Minimal-cost network flow problems with variable lower bounds on arc flows, A vertex ranking algorithm for the fixed-charge transportation problem, Use of penalties in a branch and bound procedure for the fixed charge transportation problem, Algorithms for the single-source uncapacitated minimum concave-cost network flow problem, 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, A family of heuristic solution methods for a class of nonlinear programming problems, A branch-and-bound algorithm for solving a fixed charge problem in the profit optimization of sawn timber production, The noncooperative 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, COLE: a new heuristic approach for fixed charge problem computational results, A solution approach to the fixed charge network flow problem using a dynamic slope scaling procedure, Fixed charge problems with identical fixed charges, Fractional polynomial bounds for the fixed charge problem, A tabu search heuristic procedure for the fixed charge transportation problem
