Flots entiers et multiflots fractionnaires couplés par une contrainte de capacité
From MaRDI portal
Publication:5479860
DOI10.1051/ro:2006003zbMath1103.90027OpenAlexW3010556193MaRDI QIDQ5479860
Alain Quilliot, Jean Mailfert, Fatiha Bendali
Publication date: 11 July 2006
Published in: RAIRO - Operations Research (Search for Journal in Brave)
Full work available at URL: http://www.numdam.org/item?id=RO_2005__39_3_185_0
Convex programming (90C25) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10)
Cites Work
- Multiperiod capacity expansion of road networks: Formulation and algorithms
- A survey of dynamic network flows
- Partitioning procedures for solving mixed-variables programming problems
- Solving the optimal network problem
- Topological design of telecommunication networks --- local access design methods
- The Steiner tree problem
- Tactical design of rail freight networks. I: Exact and heuristic methods
- Multicommodity network flows: The impact of formulation on decomposition
- The Steiner tree problem. I: Formulations, compositions and extensions and extension of facets
- A polyhedral approach to multicommodity survivable network design
- Generalized Benders decomposition
- The Air Traffic Flow Management Problem with Enroute Capacities
- Designing Hierarchical Survivable Networks
- Airline Network Design
- A Survey of Optimization Models for Train Routing and Scheduling
- Dual Ascent Methods for Problems with Strictly Convex Costs and Linear Constraints: A Unified Approach
- Lower planes for the network design problem
- A Survey of Algorithms for Convex Multicommodity Flow Problems
- Fixed-cost transportation problems
- Finding minimum-cost circulations by canceling negative cycles
- Relaxation Methods for Network Flow Problems with Convex Arc Costs
- Networks synthesis and optimum network design problems: Models, solution methods and applications
- Optimum Synthesis of a Network with Non-Simultaneous Multicommodity Flow Requirements
- Topological optimization of networks: A nonlinear mixed integer model employing generalized Benders decomposition
- Worst-Case Analysis of Network Design Problem Heuristics
- Multicommodity network flows—A survey
- The complexity of the network design problem
- Exact and approximate algorithms for optimal network design
- Airline network design and hub location problems
- A Primal Partitioning Solution for the Arc-Chain Formulation of a Multicommodity Network Flow Problem
- A Dual-Based Algorithm for Multi-Level Network Design
- Modelling Hydro Reservoir Operation in a Deregulated Electricity Market
- Planning and consolidating shipments from a warehouse
- A Simplex-Based Tabu Search Method for Capacitated Network Design
- Network Design Using Cut Inequalities
- Competitive Location Models: A Framework and Bibliography
- An Efficient Branch and Bound Algorithm for the Warehouse Location Problem
- Optimal Dimensioning of Pipe Networks with Application to Gas Transmission Networks
- Solving the dynamic facility location problem
- Capacitated Network Design—Polyhedral Structure and Computation
- Bundle-based relaxation methods for multicommodity capacitated fixed charge network design
- Capacity and flow assignment of data networks by generalized Benders decomposition
- Multi-exchange neighborhood structures for the capacitated minimum spanning tree problem
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
