Pages that link to "Item:Q1341992"

The following pages link to A Lagrangean heuristic for the capacitated concave minimum cost network flow problem (Q1341992):

Displaying 22 items.

• On a finite branch and bound algorithm for the global minimization of a concave power law over a polytope (Q650234) (← links)
• Global and local search algorithms for concave cost transshipment problems (Q811873) (← links)
• A surrogate and Lagrangian approach to constrained network problems (Q920831) (← links)
• A decentralized coordination mechanism for integrated production-transportation-inventory problem in the supply chain using Lagrangian relaxation (Q1001384) (← links)
• An integer concave minimization approach for the minimum concave cost capacitated flow problem on networks (Q1384224) (← links)
• The fixed charge transportation problem: a strong formulation based on Lagrangian decomposition and column generation (Q1630276) (← links)
• Probabilistic local search algorithms for concave cost transportation network problems (Q1806939) (← links)
• The concave cost supply problem. (Q1810527) (← links)
• Lagrangian relaxation for the multiple constrained robust shortest path problem (Q2298370) (← links)
• Correlative sparsity structures and semidefinite relaxations for concave cost transportation problems with change of variables (Q2392116) (← links)
• A continuous approach for the concave cost supply problem via DC programming and DCA (Q2473032) (← links)
• Convergent Lagrangian heuristics for nonlinear minimum cost network flows (Q2480971) (← links)
• Lower bounds from state space relaxations for concave cost network flow problems (Q2494472) (← links)
• Utilizing the surrogate dual bound in capacity planning with economies of scale (Q2867324) (← links)
• A heuristic algorithm for a network problem with variable upper bounds (Q3199211) (← links)
• Heuristic solutions for general concave minimum cost network flow problems (Q3593371) (← links)
• Lagrangian dual coordinatewise maximization algorithm for network transportation problems with quadratic costs (Q3712122) (← links)
• (Q3840281) (← links)
• Computational development of a lagrangian dual approach for quadratic networks (Q3977272) (← links)
• Approximate solutions of capacitated fixed-charge minimum cost network flow problems (Q3984287) (← links)
• A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem (Q4530653) (← links)
• A meta-heuristic extension of the Lagrangian heuristic framework (Q6644992) (← links)