Variable Disaggregation in Network Flow Problems with Piecewise Linear Costs
From MaRDI portal
Publication:3392064
DOI10.1287/opre.1060.0314zbMath1167.90602OpenAlexW2124847400MaRDI QIDQ3392064
Thomas L. Magnanti, Bernard Gendron, Keely L. Croxton
Publication date: 13 August 2009
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/cfaa821e157ed83a4d2305d0c2d00a31664bba37
Related Items
Exact approaches to the single-source network loading problem, Multimodal freight transportation planning: a literature review, A parametric simplex algorithm for biobjective piecewise linear programming problems, Equivalence of Two Optimality Conditions for Polyhedral Functions, DC programming and DCA for solving Brugnano-Casulli piecewise linear systems, On the hop-constrained survivable network design problem with reliable edges, A stabilized structured Dantzig-Wolfe decomposition method, Single Allocation Hub Location with Heterogeneous Economies of Scale, The piecewise linear optimization polytope: new inequalities and intersection with semi-continuous constraints, New partial aggregations for multicommodity network flow problems: an application to the fixed-charge network design problem, General network design: a unified view of combined location and network design problems, On modelling non-linear quantity discounts in a supplier selection problem by mixed linear integer optimization, A Combined Matheuristic for the Piecewise Linear Multicommodity Network Flow Problem, Branch-and-cut for separable piecewise linear optimization and intersection with semi-continuous constraints, Column generation for extended formulations, Freight consolidation with divisible shipments, delivery time windows, and piecewise transportation costs, Mileage bands in freight transportation, Models and heuristics for the k ‐degree constrained minimum spanning tree problem with node‐degree costs, Models for the piecewise linear unsplittable multicommodity flow problems, Lagrangean-based decomposition algorithms for multicommodity network design problems with penalized constraints, Modeling and solving a multimodal transportation problem with flexible-time and scheduled services, Mixed Integer Linear Programming Formulation Techniques, An effective logarithmic formulation for piecewise linearization requiring no inequality constraint, A modeling framework and local search solution methodology for a production-distribution problem with supplier selection and time-aggregated quantity discounts, 0-1 reformulations of the multicommodity capacitated network design problem, The impact of distribution system characteristics on computational tractability
