Solving the Fixed Charge Problem by Ranking the Extreme Points

Cited in

(68)

A genetic algorithm for the two-stage supply chain distribution problem associated with a fixed charge
Ranking of vertices in the linear fractional programming problem
Pivoting rules and redundancy schemes in extreme point enumeration
Enumerative techniques for solving some nonconvex global optimization problems
A search tree algorithm for plant location problems
A vertex ranking algorithm for the fixed-charge transportation problem
Global search algorithms for minimum concave-cost network flow problems
Linear multiplicative programming
Quasi-concave minimization subject to linear constraints
Maximization of linearly constrained posynomials
Concave cost minimization on networks
Two-best solutions under distance constraints: The model and exemplary results for matroids
A solution approach to the fixed charge network flow problem using a dynamic slope scaling procedure
A set covering reformulation of the pure fixed charge transportation problem
A mathematical programming approach to a problem in variance penalised Markov decision processes
A finite concave minimization algorithm using branch and bound and neighbor generation
A Lagrangean heuristic for the capacitated concave minimum cost network flow problem
An operational decision model for lead-time and price quotation in congested manufacturing systems
A tabu search heuristic procedure for the fixed charge transportation problem
The fixed charge transportation problem: a strong formulation based on Lagrangian decomposition and column generation
Solving fixed charge transportation problem with truck load constraint using metaheuristics
A genetic algorithm for solving the fixed-charge transportation model: two-stage problem
Solving fixed charge transportation problem with interval parameters
Facets and algorithms for capacitated lot sizing
An algorithm for a class of nonlinear fractional problems using ranking of the vertices
An algorithm for determining redundant inequalities and all solutions to convex polyhedra
An algebra-based approach for linearly constrained concave minimization
Maximizing pseudoconvex transportation problem: A special type
Computational risk management techniques for fixed charge network flow problems with uncertain arc failures
A combined cutting-stock and lot-sizing problem
Minimum concave-cost network flow problems: Applications, complexity, and algorithms
Fractional polynomial bounds for the fixed charge problem
A weighting method for 0-1 indefinite quadratic bilevel programming
A heuristic algorithm for the fixed charge problem
Optimum synthesis of discrete capacitated networks with multi-terminal commodity flow requirements
On the indefinite quadratic bilevel programming problem.
Adaptive dynamic cost updating procedure for solving fixed charge network flow problems
Dynamic slope scaling procedure and Lagrangian relaxation with subproblem approximation
Enhanced intersection cutting-plane approach for linear complementarity problems
COLE: a new heuristic approach for fixed charge problem computational results
On lower bounds for the fixed charge problem
The pure fixed charge transportation problem
A systematic extreme point enumeration procedure for fixed charge problem
Degeneracy in fixed cost transportation problems
The zero pivot phenomenon in transportation and assignment problems and its computational implications
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 algorithm for determining all extreme points of a convex polytope
Some computational results of using the Ahrens—Finke method for handling degeneracy in fixed charge transportation problems
An algorithm for solving fixed charge bi-criterion transportation problem with restricted flow
The Kth TSP is pseudopolynomial when TSP is polynomial
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
Multi-index fixed charge bi-criterion transshipment problem
Fuzzy goal programming technique for multi-objective indefinite quadratic bilevel programming problem
An extreme-point-ranking algorithm for the extreme-point mathematical programming problem
A general purpose exact solution method for mixed integer concave minimization problems
Maximizing strictly convex quadratic functions with bounded perturbations
Non-convex optimization problems with linear KKT subsystem
Complexity and approximation algorithms for fixed charge transportation problems
Complexity and approximation algorithms for fixed charge transportation problems
Support Discovery With Iteratively Reweighted Least Squares for Fixed-Charge Network Flow
A model for two-stage fixed charge transportation problem with multiple objectives and fuzzy linguistic preferences
Global optimization algorithms for linearly constrained indefinite quadratic problems
Bilinear modeling solution approach for fixed charge network flow problems
Jointly constrained bilinear programs and related problems: An overview
On the nonlinear multilevel programming problems
Heuristic algorithms for the fixed-charge transportation problem

This page was built for publication: Solving the Fixed Charge Problem by Ranking the Extreme Points

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