Solving the Fixed Charge Problem by Ranking the Extreme Points
From MaRDI portal
Publication:5663636
DOI10.1287/opre.16.2.268zbMath0249.90041OpenAlexW2049536263MaRDI QIDQ5663636
Publication date: 1968
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.16.2.268
Related Items
A weighting method for 0-1 indefinite quadratic bilevel programming, An algebra-based approach for linearly constrained concave minimization, A finite concave minimization algorithm using branch and bound and neighbor generation, The fixed charge transportation problem: a strong formulation based on Lagrangian decomposition and column generation, A Lagrangean heuristic for the capacitated concave minimum cost network flow problem, Bilinear modeling solution approach for fixed charge network flow problems, Maximizing pseudoconvex transportation problem: A special type, Enumerative techniques for solving some nonconvex global optimization problems, The Kth TSP is pseudopolynomial when TSP is polynomial, On lower bounds for the fixed charge problem, A general purpose exact solution method for mixed integer concave minimization problems, A search tree algorithm for plant location problems, Computational risk management techniques for fixed charge network flow problems with uncertain arc failures, A heuristic algorithm for the fixed charge problem, A vertex ranking algorithm for the fixed-charge transportation problem, A systematic extreme point enumeration procedure for fixed charge problem, An algorithm for solving fixed charge bi-criterion transportation problem with restricted flow, Maximizing strictly convex quadratic functions with bounded perturbations, Degeneracy in fixed cost transportation problems, Jointly constrained bilinear programs and related problems: An overview, A combined cutting-stock and lot-sizing problem, Solving fixed charge transportation problem with truck load constraint using metaheuristics, Fuzzy goal programming technique for multi-objective indefinite quadratic bilevel programming problem, Multi-index fixed charge bi-criterion transshipment problem, Optimum synthesis of discrete capacitated networks with multi-terminal commodity flow requirements, Global search algorithms for minimum concave-cost network flow problems, On the indefinite quadratic bilevel programming problem., Adaptive dynamic cost updating procedure for solving fixed charge network flow problems, Linear multiplicative programming, A genetic algorithm for solving the fixed-charge transportation model: two-stage problem, The zero pivot phenomenon in transportation and assignment problems and its computational implications, Quasi-concave minimization subject to linear constraints, A relaxation algorithm for the minimization of a quasiconcave function on a convex polyhedron, Using shortest paths in some transshipment problems with concave costs, An extreme-point-ranking algorithm for the extreme-point mathematical programming problem, Minimum concave-cost network flow problems: Applications, complexity, and algorithms, Dynamic slope scaling procedure and Lagrangian relaxation with subproblem approximation, An algorithm for determining all extreme points of a convex polytope, Solving fixed charge transportation problem with interval parameters, Maximization of linearly constrained posynomials, On the nonlinear multilevel programming problems, Heuristic algorithms for the fixed-charge transportation problem, Some computational results of using the Ahrens—Finke method for handling degeneracy in fixed charge transportation problems, A genetic algorithm for the two-stage supply chain distribution problem associated with a fixed charge, Concave cost minimization on networks, Facets and algorithms for capacitated lot sizing, An algorithm for a class of nonlinear fractional problems using ranking of the vertices, Two-best solutions under distance constraints: The model and exemplary results for matroids, A model for two-stage fixed charge transportation problem with multiple objectives and fuzzy linguistic preferences, Enhanced intersection cutting-plane approach for linear complementarity problems, An operational decision model for lead-time and price quotation in congested manufacturing systems, An algorithm for determining redundant inequalities and all solutions to convex polyhedra, COLE: a new heuristic approach for fixed charge problem computational results, Ranking of vertices in the linear fractional programming problem, A solution approach to the fixed charge network flow problem using a dynamic slope scaling procedure, Fractional polynomial bounds for the fixed charge problem, Pivoting rules and redundancy schemes in extreme point enumeration, An algorithm for the optimum time-cost trade-off in fixed-charge bi-criterion transportation problem bi-criterion transportation problem, Die Lösung eines nichtlinearen Investitionsproblems mit Hilfe binärer Optimierungsalgorithmen — gezeigt am Beispiel der Planung regionaler Abwasserbehandlungssysteme, A set covering reformulation of the pure fixed charge transportation problem, A mathematical programming approach to a problem in variance penalised Markov decision processes, Global optimization algorithms for linearly constrained indefinite quadratic problems, A tabu search heuristic procedure for the fixed charge transportation problem, The pure fixed charge transportation problem
