Bilinear modeling solution approach for fixed charge network flow problems
From MaRDI portal
Publication:839798
DOI10.1007/s11590-009-0114-0zbMath1170.90334OpenAlexW1973696214MaRDI QIDQ839798
Panos M. Pardalos, Steffen Rebennack, Artyom Nahapetyan
Publication date: 3 September 2009
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-009-0114-0
Related Items
A parametric simplex algorithm for biobjective piecewise linear programming problems, Disjoint Bilinear Optimization: A Two-Stage Robust Optimization Perspective, LP-based approximations for disjoint bilinear and two-stage adjustable robust optimization, A multi-population hybrid biased random key genetic algorithm for hop-constrained trees in nonlinear cost flow networks, A mixed-integer linear programming reduction of disjoint bilinear programs via symbolic variable elimination, Convex Maximization via Adjustable Robust Optimization, Degeneracy removal in cutting plane methods for disjoint bilinear programming, Lifted inequalities for \(0-1\) mixed-integer bilinear covering sets, Polylithic modeling and solution approaches using algebraic modeling systems, Convexification of bilinear forms through non-symmetric lifting, Location of a conservative hyperplane for cutting plane methods in disjoint bilinear programming
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Global optimization algorithms for linearly constrained indefinite quadratic problems
- An enhanced dynamic slope scaling procedure with tabu scheme for fixed charge network flow problems
- A parallel algorithm for constrained concave quadratic global minimization
- Quadratic programming with one negative eigenvalue is NP-hard
- A solution approach to the fixed charge network flow problem using a dynamic slope scaling procedure
- Strong polynomial-time solvability of a minimum concave cost network flow problem.
- A survey on Benders decomposition applied to fixed-charge network design problems
- A branch-and-reduce approach to global optimization
- BARON: A general purpose global optimization software package
- Minimum concave-cost network flow problems: Applications, complexity, and algorithms
- A bilinear relaxation based algorithm for concave piecewise linear network flow problems
- A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations
- Adaptive dynamic cost updating procedure for solving fixed charge network flow problems
- A branch-and-bound algorithm for concave network flow problems
- A dynamic programming approach for solving single-source uncapacitated concave minimum cost network flow problems
- Some branch-and-bound procedures for fixed-cost transportation problems
- Global minimization algorithms for concave quadratic programming problems
- Heuristic solutions for general concave minimum cost network flow problems
- A cutting plane algorithm for solving bilinear programs
- A Global Optimization Algorithm for Concave Quadratic Programming Problems
- Dynamic slope scaling and trust interval techniques for solving concave piecewise linear network flow problems
- A branch‐and‐cut algorithm for the single‐commodity, uncapacitated, fixed‐charge network flow problem
- The fixed charge problem
- Solving the Fixed Charge Problem by Ranking the Extreme Points
- A Branch-and-Bound Method for the Fixed Charge Transportation Problem
