An improved branch and bound algorithm for minimum concave cost network flow problems
From MaRDI portal
(Redirected from Publication:686988)
Recommendations
- A branch-and-bound algorithm for concave network flow problems
- An integer concave minimization approach for the minimum concave cost capacitated flow problem on networks
- scientific article; zbMATH DE number 1086904
- Global search algorithms for minimum concave-cost network flow problems
- Algorithms for the single-source uncapacitated minimum concave-cost network flow problem
Cites work
- A Capacity Improvement Lower Bound for Fixed Charge Network Design Problems
- A New Branch-and-Bound Algorithm for the Fixed-Charge Transportation Problem
- A New Optimization Method for Large Scale Fixed Charge Transportation Problems
- Algorithms for the single-source uncapacitated minimum concave-cost network flow problem
- An algorithm for the min concave cost flow problem
- An Algorithm for the Traveling Salesman Problem
- An Implicit Enumeration Algorithm for the Concave Cost Network Flow Problem
- Computationally Efficient Optimal Solutions to the Lot-Sizing Problem in Multistage Assembly Systems
- Enhancements Of Spanning Tree Labelling Procedures For Network Optimization
- Fixed-cost transportation problems
- Global search algorithms for minimum concave-cost network flow problems
- scientific article; zbMATH DE number 3174052 (Why is no real title available?)
- scientific article; zbMATH DE number 193499 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- Improved Penalties for Fixed Cost Linear Programs Using Lagrangean Relaxation
- Minimum Concave Cost Flows in Certain Networks
- Minimum concave-cost network flow problems: Applications, complexity, and algorithms
- Minimum cost routing for static network models
- Network flow problems with one side constraint: A comparison of three solution methods
- On the fixed cost flow problem†
- Optimal Facility Location with Concave Costs
- Send-and-Split Method for Minimum-Concave-Cost Network Flows
- Some branch-and-bound procedures for fixed-cost transportation problems
- Technical Note—An Improved Branch-and-Bound Method for Integer Programming
- Technical Note—Exact Solution of the Fixed-Charge Transportation Problem
Cited in
(15)- Global search algorithms for minimum concave-cost network flow problems
- An integer concave minimization approach for the minimum concave cost capacitated flow problem on networks
- Network cost minimization using threshold-based discounting
- Domain reduction techniques for global NLP and MINLP optimization
- A concave link elimination (CLE) procedure and lower bound for concave topology, capacity and flow assignment network design problems
- Nonconvex optimization over a polytope using generalized capacity improvement
- A branch-and-reduce approach to global optimization
- A deterministic annealing algorithm for the minimum concave cost network flow problem
- Correlative sparsity structures and semidefinite relaxations for concave cost transportation problems with change of variables
- Lower bounds from state space relaxations for concave cost network flow problems
- A branch-and-bound algorithm for concave network flow problems
- scientific article; zbMATH DE number 1330764 (Why is no real title available?)
- scientific article; zbMATH DE number 1086904 (Why is no real title available?)
- scientific article; zbMATH DE number 1927152 (Why is no real title available?)
- On a finite branch and bound algorithm for the global minimization of a concave power law over a polytope
This page was built for publication: An improved branch and bound algorithm for minimum concave cost network flow problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q686988)
