Pages that link to "Item:Q1306360"

The following pages link to A solution approach to the fixed charge network flow problem using a dynamic slope scaling procedure (Q1306360):

Displaying 45 items.

• A variable fixing heuristic with local branching for the fixed charge uncapacitated network design problem with user-optimal flow (Q342561) (← links)
• Cost-based decision-making in middleware virtualization environments (Q531466) (← links)
• A biased random-key genetic algorithm for road congestion minimization (Q601986) (← links)
• A heuristic method for the minimum toll booth problem (Q604959) (← links)
• Some classes of valid inequalities and convex hull characterizations for dynamic fixed-charge problems under nested constraints (Q817207) (← links)
• Bilinear modeling solution approach for fixed charge network flow problems (Q839798) (← links)
• An enhanced dynamic slope scaling procedure with tabu scheme for fixed charge network flow problems (Q853587) (← links)
• A genetic algorithm for the two-stage supply chain distribution problem associated with a fixed charge (Q1002061) (← links)
• A model for the capacitated, hop-constrained, per-packet wireless mesh network design problem (Q1014998) (← links)
• Efficient heuristics for inventory placement in acyclic networks (Q1025232) (← links)
• The family constrained network problem (Q1076616) (← links)
• Solving to optimality the uncapacitated fixed-charge network flow problem (Q1265864) (← links)
• The fixed charge transportation problem: a strong formulation based on Lagrangian decomposition and column generation (Q1630276) (← links)
• A parallel local search framework for the fixed-charge multicommodity network flow problem (Q1652019) (← links)
• Combined column-and-row-generation for the optimal communication spanning tree problem (Q1652585) (← links)
• Solving fixed charge transportation problem with truck load constraint using metaheuristics (Q1730658) (← links)
• Matheuristics based on iterative linear programming and slope scaling for multicommodity capacitated fixed charge network design (Q1754304) (← links)
• A computational study of using preprocessing and stronger formulations to solve large general fixed charge problems (Q1823858) (← links)
• Solving fixed-charge network flow problems with a hybrid optimization and constraint programming approach (Q1854755) (← links)
• Local smooth representations of parametric semiclosed polyhedra with applications to sensitivity in piecewise linear programs (Q1935266) (← links)
• Computational risk management techniques for fixed charge network flow problems with uncertain arc failures (Q1945698) (← links)
• Dynamic programming and heuristic for stochastic uncapacitated lot-sizing problems with incremental quantity discount (Q1954948) (← links)
• Scalable algorithms for designing \(\mathrm{CO}_2\) capture and storage infrastructure (Q2147939) (← links)
• Fixed charge transportation problems: a new heuristic approach based on Lagrangean relaxation and the solving of core problems (Q2267294) (← links)
• A bilinear reduction based algorithm for solving capacitated multi-item dynamic pricing problems (Q2459395) (← links)
• Optimum synthesis of discrete capacitated networks with multi-terminal commodity flow requirements (Q2468776) (← links)
• Adaptive dynamic cost updating procedure for solving fixed charge network flow problems (Q2479831) (← links)
• Lower bounds from state space relaxations for concave cost network flow problems (Q2494472) (← links)
• A branch-and-bound algorithm for concave network flow problems (Q2494473) (← links)
• A dynamic programming approach for solving single-source uncapacitated concave minimum cost network flow problems (Q2503087) (← links)
• Dynamic slope scaling procedure and Lagrangian relaxation with subproblem approximation (Q2505552) (← links)
• COLE: a new heuristic approach for fixed charge problem computational results (Q2573014) (← links)
• A taxonomy of multilayer network design and a survey of transportation and telecommunication applications (Q2673552) (← links)
• Scheduled service network design for freight rail transportation (Q2875607) (← links)
• Combining exact and heuristic approaches for the capacitated fixed-charge network flow problem (Q2899064) (← links)
• The uncapacitated time-space fixed-charge network flow problem: an empirical investigation of procedures for arc capacity assignment (Q2899066) (← links)
• Artificial immune system and sheep flock algorithms for two-stage fixed-charge transportation problem (Q2926472) (← links)
• Modeling and solving a multimodal transportation problem with flexible-time and scheduled services (Q3076017) (← links)
• A relaxation/decomposition algorithm for the fixed charged network problem (Q3478275) (← links)
• Capacity improvement, penalties, and the fixed charge transportation problem (Q4261216) (← links)
• Dynamic slope scaling and trust interval techniques for solving concave piecewise linear network flow problems (Q4488862) (← links)
• Accelerating benders decomposition with heuristicmaster problem solutions (Q4904321) (← links)
• Minimum‐cost flow problems having arc‐activation costs (Q6077360) (← links)
• A sequential reduction algorithm for the large-scale fixed-charge network flow problems (Q6542455) (← links)
• Cluster before you hallucinate: node-capacitated network design and energy efficient routing (Q6550988) (← links)