Pages that link to "Item:Q4808430"

The following pages link to A branch‐and‐cut algorithm for the single‐commodity, uncapacitated, fixed‐charge network flow problem (Q4808430):

Displaying 39 items.

• Single-commodity robust network design problem: complexity, instances and heuristic solutions (Q296864) (← links)
• On lower bounds for the fixed charge problem (Q337190) (← links)
• Algebraic modeling for IP and MIP (GAMS) (Q537584) (← links)
• Minimal-cost network flow problems with variable lower bounds on arc flows (Q632657) (← links)
• The M{\texttt{CF}}-separator: Detecting and exploiting multi-commodity flow structures in MIPs (Q708779) (← links)
• Bilinear modeling solution approach for fixed charge network flow problems (Q839798) (← links)
• A cutting plane algorithm for the capacitated facility location problem (Q842775) (← links)
• Nonconvex, lower semicontinuous piecewise linear optimization (Q951120) (← links)
• Uncapacitated lot sizing with backlogging: the convex hull (Q1016115) (← links)
• An effective linear approximation method for separable programming problems (Q1036545) (← links)
• The tree of hubs location problem (Q1039782) (← links)
• The impact of filtering in a branch-and-cut algorithm for multicommodity capacitated fixed charge network design (Q1616826) (← links)
• Upgrading nodes in tree-shaped hub location (Q1628119) (← links)
• Combined column-and-row-generation for the optimal communication spanning tree problem (Q1652585) (← links)
• Exact and heuristic approaches for the cycle hub location problem (Q1686520) (← links)
• Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning (Q1751150) (← links)
• Computational risk management techniques for fixed charge network flow problems with uncertain arc failures (Q1945698) (← links)
• A deterministic annealing algorithm for the minimum concave cost network flow problem (Q1952548) (← links)
• Directed fixed charge multicommodity network design: a cutting plane approach using polar duality (Q2077967) (← 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)
• Exact algorithms based on Benders decomposition for multicommodity uncapacitated fixed-charge network design (Q2273684) (← links)
• Fractional polynomial bounds for the fixed charge problem (Q2342141) (← links)
• The minimum flow cost Hamiltonian cycle problem: a comparison of formulations (Q2348064) (← links)
• Approximability of capacitated network design (Q2354026) (← links)
• Optimization models for forest road upgrade planning (Q2369960) (← links)
• Genetic algorithms for a supply management problem: MIP-recombination vs greedy decoder (Q2378418) (← 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)
• Towards optimizing the deployment of optical access networks (Q2513732) (← links)
• Branch-and-price-and-cut for large-scale multicommodity capacitated fixed-charge network design (Q2513734) (← links)
• COLE: a new heuristic approach for fixed charge problem computational results (Q2573014) (← links)
• Artificial immune system and sheep flock algorithms for two-stage fixed-charge transportation problem (Q2926472) (← links)
• Solving biobjective network flow problem associated with minimum cost-time loading (Q3389544) (← links)
• Branch-and-Cut Techniques for Solving Realistic Two-Layer Network Design Problems (Q3404461) (← links)
• Estimating the Size of Branch-and-Bound Trees (Q5085999) (← links)
• Network Models with Unsplittable Node Flows with Application to Unit Train Scheduling (Q5129179) (← links)
• Minimum‐cost flow problems having arc‐activation costs (Q6077360) (← links)