Pages that link to "Item:Q2277131"

The following pages link to Minimum concave-cost network flow problems: Applications, complexity, and algorithms (Q2277131):

Displaying 45 items.

• Two classical transportation problems revisited: pure constant fixed charges and the paradox (Q409900) (← links)
• On solving continuous-time dynamic network flows (Q453631) (← links)
• On a finite branch and bound algorithm for the global minimization of a concave power law over a polytope (Q650234) (← links)
• An improved branch and bound algorithm for minimum concave cost network flow problems (Q686988) (← links)
• Open questions in complexity theory for numerical optimization (Q687097) (← links)
• A modified simplicial algorithm for convex maximization based on an extension of \(\omega \)-subdivision (Q721144) (← links)
• A model for two-stage fixed charge transportation problem with multiple objectives and fuzzy linguistic preferences (Q780181) (← links)
• Bilinear modeling solution approach for fixed charge network flow problems (Q839798) (← links)
• Resource downgrading (Q856251) (← links)
• Strategic design of distribution systems with economies of scale in transportation (Q867550) (← links)
• Complexity analysis for maximum flow problems with arc reversals (Q965819) (← links)
• Global search algorithms for minimum concave-cost network flow problems (Q1200522) (← links)
• Algorithms for the single-source uncapacitated minimum concave-cost network flow problem (Q1200636) (← links)
• A solution approach to the fixed charge network flow problem using a dynamic slope scaling procedure (Q1306360) (← links)
• Parallel computing in nonconvex programming (Q1309859) (← links)
• A composite branch and bound, cutting plane algorithm for concave minimization over a polyhedron (Q1332814) (← links)
• Minimizing a linear multiplicative-type function under network flow constraints (Q1362518) (← links)
• An integer concave minimization approach for the minimum concave cost capacitated flow problem on networks (Q1384224) (← links)
• Network cost minimization using threshold-based discounting (Q1600844) (← links)
• On modelling non-linear quantity discounts in a supplier selection problem by mixed linear integer optimization (Q1686496) (← links)
• A dynamic programming approach for the pipe network layout problem (Q1735166) (← links)
• Valid inequalities for separable concave constraints with indicator variables (Q1801013) (← links)
• The minimum concave cost network flow problem with fixed numbers of sources and nonlinear arc costs (Q1804581) (← links)
• A strongly polynomial algorithm for a concave production-transportation problem with a fixed number of nonlinear variables (Q1919095) (← links)
• Scalable algorithms for designing \(\mathrm{CO}_2\) capture and storage infrastructure (Q2147939) (← links)
• A model for optimization of transport infrastructure for some homogeneous goods markets (Q2174272) (← links)
• A novel matheuristic approach for a two-stage transportation problem with fixed costs associated to the routes (Q2185523) (← links)
• Energy markets: optimization of transmission networks (Q2190626) (← links)
• Fixed charge transportation problems: a new heuristic approach based on Lagrangean relaxation and the solving of core problems (Q2267294) (← links)
• Minimum concave-cost network flow problems: Applications, complexity, and algorithms (Q2277131) (← links)
• Minimum concave cost flow over a grid network (Q2340279) (← links)
• Correlative sparsity structures and semidefinite relaxations for concave cost transportation problems with change of variables (Q2392116) (← links)
• Optimization of an energy market transportation system (Q2411814) (← links)
• Adaptive dynamic cost updating procedure for solving fixed charge network flow problems (Q2479831) (← links)
• Complexity and algorithms for nonlinear optimization problems (Q2480263) (← links)
• On the computational power of molecular heat engines (Q2492778) (← links)
• A dynamic programming approach for solving single-source uncapacitated concave minimum cost network flow problems (Q2503087) (← links)
• On budget-constrained flow improvement. (Q2583570) (← links)
• A Lagrangian heuristic for concave cost facility location problems: the plant location and technology acquisition problem (Q2629912) (← links)
• On the Computational Complexity of Minimum-Concave-Cost Flow in a Two-Dimensional Grid (Q2828332) (← links)
• Valid Inequalities for Separable Concave Constraints with Indicator Variables (Q3186509) (← links)
• Solving biobjective network flow problem associated with minimum cost-time loading (Q3389544) (← links)
• Approximation algorithms for general one-warehouse multi-retailer systems (Q5305566) (← links)
• Avoiding unnecessary demerging and remerging of multi‐commodity integer flows (Q6092659) (← links)
• A general purpose exact solution method for mixed integer concave minimization problems (Q6112823) (← links)