Variable Disaggregation in Network Flow Problems with Piecewise Linear Costs
From MaRDI portal
Publication:3392064
Recommendations
- scientific article; zbMATH DE number 1795722
- Structural investigation of piecewise linearized network flow problems
- New formulation and relaxation to solve a concave-cost network flow problem
- Models for the piecewise linear unsplittable multicommodity flow problems
- A combined matheuristic for the piecewise linear multicommodity network flow problem
Cited in
(31)- 0-1 reformulations of the multicommodity capacitated network design problem
- The impact of distribution system characteristics on computational tractability
- DC programming and DCA for solving Brugnano-Casulli piecewise linear systems
- On modelling non-linear quantity discounts in a supplier selection problem by mixed linear integer optimization
- Freight consolidation with divisible shipments, delivery time windows, and piecewise transportation costs
- Models for the piecewise linear unsplittable multicommodity flow problems
- Product disaggregation in global optimization and relaxations of rational programs
- General network design: a unified view of combined location and network design problems
- Branch-and-cut for separable piecewise linear optimization and intersection with semi-continuous constraints
- Mileage bands in freight transportation
- 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
- A parametric simplex algorithm for biobjective piecewise linear programming problems
- New partial aggregations for multicommodity network flow problems: an application to the fixed-charge network design problem
- Mixed integer linear programming formulation techniques
- Exact approaches to the single-source network loading problem
- Structural investigation of piecewise linearized network flow problems
- Multimodal freight transportation planning: a literature review
- 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
- A comparison of mixed-integer programming models for nonconvex piecewise linear cost minimization problems
- On the hop-constrained survivable network design problem with reliable edges
- A stabilized structured Dantzig-Wolfe decomposition method
- The piecewise linear optimization polytope: new inequalities and intersection with semi-continuous constraints
- Column generation for extended formulations
- A combined matheuristic for the piecewise linear multicommodity network flow problem
- Models and heuristics for the \(k\)-degree constrained minimum spanning tree problem with node-degree costs
- Equivalence of two optimality conditions for polyhedral functions
- Single allocation hub location with heterogeneous economies of scale
- Lifting-based PWA control: a global solution to handle disturbances in the state space partitions
- Strengthening dual bounds for multicommodity capacitated network design with unsplittable flow constraints
This page was built for publication: Variable Disaggregation in Network Flow Problems with Piecewise Linear Costs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3392064)
