Pages that link to "Item:Q5663636"
From MaRDI portal
The following pages link to Solving the Fixed Charge Problem by Ranking the Extreme Points (Q5663636):
Displaying 50 items.
- On lower bounds for the fixed charge problem (Q337190) (← links)
- Multi-index fixed charge bi-criterion transshipment problem (Q505158) (← links)
- An extreme-point-ranking algorithm for the extreme-point mathematical programming problem (Q580171) (← links)
- Maximizing strictly convex quadratic functions with bounded perturbations (Q639197) (← links)
- A model for two-stage fixed charge transportation problem with multiple objectives and fuzzy linguistic preferences (Q780181) (← links)
- Global optimization algorithms for linearly constrained indefinite quadratic problems (Q810370) (← links)
- Bilinear modeling solution approach for fixed charge network flow problems (Q839798) (← links)
- Jointly constrained bilinear programs and related problems: An overview (Q918873) (← links)
- On the nonlinear multilevel programming problems (Q998684) (← links)
- Heuristic algorithms for the fixed-charge transportation problem (Q998695) (← links)
- A genetic algorithm for the two-stage supply chain distribution problem associated with a fixed charge (Q1002061) (← links)
- Ranking of vertices in the linear fractional programming problem (Q1053617) (← links)
- Pivoting rules and redundancy schemes in extreme point enumeration (Q1063390) (← links)
- Enumerative techniques for solving some nonconvex global optimization problems (Q1102205) (← links)
- A search tree algorithm for plant location problems (Q1149880) (← links)
- A vertex ranking algorithm for the fixed-charge transportation problem (Q1151821) (← links)
- Global search algorithms for minimum concave-cost network flow problems (Q1200522) (← links)
- Linear multiplicative programming (Q1207311) (← links)
- Quasi-concave minimization subject to linear constraints (Q1215459) (← links)
- Maximization of linearly constrained posynomials (Q1245683) (← links)
- Concave cost minimization on networks (Q1257417) (← links)
- Two-best solutions under distance constraints: The model and exemplary results for matroids (Q1291060) (← links)
- A solution approach to the fixed charge network flow problem using a dynamic slope scaling procedure (Q1306360) (← links)
- A set covering reformulation of the pure fixed charge transportation problem (Q1317046) (← links)
- A mathematical programming approach to a problem in variance penalised Markov decision processes (Q1317531) (← links)
- A finite concave minimization algorithm using branch and bound and neighbor generation (Q1330802) (← links)
- A Lagrangean heuristic for the capacitated concave minimum cost network flow problem (Q1341992) (← links)
- An operational decision model for lead-time and price quotation in congested manufacturing systems (Q1584792) (← links)
- A tabu search heuristic procedure for the fixed charge transportation problem (Q1609908) (← links)
- The fixed charge transportation problem: a strong formulation based on Lagrangian decomposition and column generation (Q1630276) (← links)
- Solving fixed charge transportation problem with truck load constraint using metaheuristics (Q1730658) (← links)
- A genetic algorithm for solving the fixed-charge transportation model: two-stage problem (Q1761123) (← links)
- Solving fixed charge transportation problem with interval parameters (Q1791478) (← links)
- Facets and algorithms for capacitated lot sizing (Q1823857) (← links)
- An algorithm for a class of nonlinear fractional problems using ranking of the vertices (Q1824995) (← links)
- An algorithm for determining redundant inequalities and all solutions to convex polyhedra (Q1846732) (← links)
- An algebra-based approach for linearly constrained concave minimization (Q1876470) (← links)
- Maximizing pseudoconvex transportation problem: A special type (Q1891876) (← links)
- Computational risk management techniques for fixed charge network flow problems with uncertain arc failures (Q1945698) (← links)
- A combined cutting-stock and lot-sizing problem (Q1969834) (← links)
- Minimum concave-cost network flow problems: Applications, complexity, and algorithms (Q2277131) (← links)
- Fractional polynomial bounds for the fixed charge problem (Q2342141) (← links)
- A weighting method for 0-1 indefinite quadratic bilevel programming (Q2359528) (← links)
- A heuristic algorithm for the fixed charge problem (Q2430567) (← links)
- Optimum synthesis of discrete capacitated networks with multi-terminal commodity flow requirements (Q2468776) (← links)
- On the indefinite quadratic bilevel programming problem. (Q2477129) (← links)
- Adaptive dynamic cost updating procedure for solving fixed charge network flow problems (Q2479831) (← links)
- Dynamic slope scaling procedure and Lagrangian relaxation with subproblem approximation (Q2505552) (← links)
- Enhanced intersection cutting-plane approach for linear complementarity problems (Q2565006) (← links)
- COLE: a new heuristic approach for fixed charge problem computational results (Q2573014) (← links)
