Network design and flow problems with cross-arc costs
From MaRDI portal
Publication:2482771
DOI10.1016/J.EJOR.2006.08.066zbMATH Open1146.90342OpenAlexW2049017414MaRDI QIDQ2482771FDOQ2482771
Authors: Melinda Davey, Lisa Schkade, Amanda Siegel, Caris Wong, Amy Cohn 
Publication date: 24 April 2008
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2006.08.066
Recommendations
- Analysis of a flow problem with fixed charges
- Network transportation problem with concave cost functions of the flux on network edges and its applications
- Design of one class of transportation networks by dynamic programming
- scientific article; zbMATH DE number 3956839
- scientific article; zbMATH DE number 3906198
Deterministic network models in operations research (90B10) Transportation, logistics and supply chain management (90B06)
Cites Work
- Network flows. Theory, algorithms, and applications.
- Title not available (Why is that?)
- Solving the uncapacitated network design problem by a Lagrangean heuristic and branch-and-bound
- Networks synthesis and optimum network design problems: Models, solution methods and applications
- A hybrid tabu search/branch-and-bound algorithm for the direct flight network design problem
- A comparison of mixed-integer programming models for nonconvex piecewise linear cost minimization problems
- Composite Variable Formulations for Express Shipment Service Network Design
- Multicommodity network flows: The impact of formulation on decomposition
- Multimodal Express Package Delivery: A Service Network Design Application
- A scaling algorithm for multicommodity flow problems
- OR Practice—Large-Scale Nonlinear Network Models and Their Application
- Optimization of Network Topologies for Service Providers in the Telecommunications Market
Cited In (8)
- A matheuristic for the air transportation freight forwarder service problem
- Multimodal freight transportation planning: a literature review
- On modelling non-linear quantity discounts in a supplier selection problem by mixed linear integer optimization
- Mathematical models for selection of optimal place and size of connections considering the time-value of money
- On Network Design Problems: Fixed Cost Flows and the Covering Steiner Problem
- A combinatorial arc tolerance analysis for network flow problems
- Joint tank container demurrage policy and flow optimisation using a progressive hedging algorithm with expanded time-space network
- Minimum cost noncrossing flow problem on layered networks
This page was built for publication: Network design and flow problems with cross-arc costs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2482771)
