Bilinear modeling solution approach for fixed charge network flow problems
From MaRDI portal
Publication:839798
DOI10.1007/S11590-009-0114-0zbMATH Open1170.90334OpenAlexW1973696214MaRDI QIDQ839798FDOQ839798
Authors: Steffen Rebennack, Artyom Nahapetyan, Panos M. Pardalos 
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
Recommendations
- scientific article; zbMATH DE number 556046
- Solving to optimality the uncapacitated fixed-charge network flow problem
- A solution approach to the fixed charge network flow problem using a dynamic slope scaling procedure
- A bilinear relaxation based algorithm for concave piecewise linear network flow problems
- scientific article; zbMATH DE number 4147878
Cites Work
- BARON: A general purpose global optimization software package
- Network flows. Theory, algorithms, and applications.
- Title not available (Why is that?)
- Title not available (Why is that?)
- The fixed charge problem
- Global optimization algorithms for linearly constrained indefinite quadratic problems
- Quadratic programming with one negative eigenvalue is NP-hard
- A branch-and-reduce approach to global optimization
- 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‐cut algorithm for the single‐commodity, uncapacitated, fixed‐charge network flow problem
- Some branch-and-bound procedures for fixed-cost transportation problems
- A survey on Benders decomposition applied to fixed-charge network design problems
- Minimum concave-cost network flow problems: Applications, complexity, and algorithms
- A cutting plane algorithm for solving bilinear programs
- Solving the Fixed Charge Problem by Ranking the Extreme Points
- A Branch-and-Bound Method for the Fixed Charge Transportation Problem
- 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
- Heuristic solutions for general concave minimum cost network flow problems
- Global minimization algorithms for concave quadratic programming problems
- 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 bilinear relaxation based algorithm for concave piecewise linear network flow problems
- A solution approach to the fixed charge network flow problem using a dynamic slope scaling procedure
- A parallel algorithm for constrained concave quadratic global minimization
- Strong polynomial-time solvability of a minimum concave cost network flow problem.
- An enhanced dynamic slope scaling procedure with tabu scheme for fixed charge network flow problems
Cited In (16)
- Location of a conservative hyperplane for cutting plane methods in disjoint bilinear programming
- An enhanced dynamic slope scaling procedure with tabu scheme for fixed charge network flow problems
- Disjoint Bilinear Optimization: A Two-Stage Robust Optimization Perspective
- On two new formulations for the fixed charge network design problem with shortest path constraints
- A solution approach to the fixed charge network flow problem using a dynamic slope scaling procedure
- Degeneracy removal in cutting plane methods for disjoint bilinear programming
- A mixed-integer linear programming reduction of disjoint bilinear programs via symbolic variable elimination
- Polylithic modeling and solution approaches using algebraic modeling systems
- A multi-population hybrid biased random key genetic algorithm for hop-constrained trees in nonlinear cost flow networks
- LP-based approximations for disjoint bilinear and two-stage adjustable robust optimization
- A parametric simplex algorithm for biobjective piecewise linear programming problems
- Convexification of bilinear forms through non-symmetric lifting
- Lifted inequalities for \(0-1\) mixed-integer bilinear covering sets
- Convex Maximization via Adjustable Robust Optimization
- A sequential reduction algorithm for the large-scale fixed-charge network flow problems
- LP-based approximations for disjoint bilinear and two-stage adjustable robust optimization
Uses Software
This page was built for publication: Bilinear modeling solution approach for fixed charge network flow problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q839798)
