Pages that link to "Item:Q3392064"
From MaRDI portal
The following pages link to Variable Disaggregation in Network Flow Problems with Piecewise Linear Costs (Q3392064):
Displayed 26 items.
- Multimodal freight transportation planning: a literature review (Q297170) (← links)
- On the hop-constrained survivable network design problem with reliable edges (Q342080) (← links)
- A stabilized structured Dantzig-Wolfe decomposition method (Q359629) (← links)
- The piecewise linear optimization polytope: new inequalities and intersection with semi-continuous constraints (Q378090) (← links)
- Column generation for extended formulations (Q458128) (← links)
- 0-1 reformulations of the multicommodity capacitated network design problem (Q1025989) (← links)
- The impact of distribution system characteristics on computational tractability (Q1042484) (← links)
- DC programming and DCA for solving Brugnano-Casulli piecewise linear systems (Q1652418) (← links)
- On modelling non-linear quantity discounts in a supplier selection problem by mixed linear integer optimization (Q1686496) (← links)
- Freight consolidation with divisible shipments, delivery time windows, and piecewise transportation costs (Q1728495) (← links)
- Models for the piecewise linear unsplittable multicommodity flow problems (Q1753554) (← links)
- General network design: a unified view of combined location and network design problems (Q1926688) (← links)
- Branch-and-cut for separable piecewise linear optimization and intersection with semi-continuous constraints (Q1947201) (← links)
- Mileage bands in freight transportation (Q1991161) (← links)
- An effective logarithmic formulation for piecewise linearization requiring no inequality constraint (Q2044490) (← links)
- A modeling framework and local search solution methodology for a production-distribution problem with supplier selection and time-aggregated quantity discounts (Q2307262) (← links)
- A parametric simplex algorithm for biobjective piecewise linear programming problems (Q2628166) (← links)
- New partial aggregations for multicommodity network flow problems: an application to the fixed-charge network design problem (Q2669599) (← links)
- Mixed Integer Linear Programming Formulation Techniques (Q2808240) (← links)
- Exact approaches to the single-source network loading problem (Q2892148) (← links)
- Lagrangean-based decomposition algorithms for multicommodity network design problems with penalized constraints (Q3057143) (← links)
- Modeling and solving a multimodal transportation problem with flexible-time and scheduled services (Q3076017) (← links)
- A Combined Matheuristic for the Piecewise Linear Multicommodity Network Flow Problem (Q4602333) (← links)
- Models and heuristics for the <i>k</i> ‐degree constrained minimum spanning tree problem with node‐degree costs (Q4648687) (← links)
- Equivalence of Two Optimality Conditions for Polyhedral Functions (Q5054520) (← links)
- Single Allocation Hub Location with Heterogeneous Economies of Scale (Q5080641) (← links)