Modelling piecewise linear concave costs in a tree partitioning problem

DOI10.1016/0166-218X(92)00168-LzbMath0798.90111OpenAlexW2094449058MaRDI QIDQ1326744

Laurence A. Wolsey, El-Houssaine Aghezzaf

Publication date: 8 June 1994

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(92)00168-l

zbMATH Keywords

tree partitioningeconomic lot- sizingpiecewise linear concave cost functions

Mathematics Subject Classification ID

Mixed integer programming (90C11)

Related Items (6)

Optimizing constrained subtrees of trees ⋮ A polyhedral study of lot-sizing with supplier selection ⋮ Nonconvex, lower semicontinuous piecewise linear optimization ⋮ Uncapacitated lot-sizing with buying, sales and backlogging ⋮ An effective logarithmic formulation for piecewise linearization requiring no inequality constraint ⋮ A branch-and-cut algorithm for the stochastic uncapacitated lot-sizing problem

Cites Work

• Models for planning capacity expansion in local access telecommunication networks
• Packing and covering a tree by subtrees
• Uncapacitated lot-sizing: The convex hull of solutions
• Strong Formulations for Multi-Item Capacitated Lot Sizing

This page was built for publication: Modelling piecewise linear concave costs in a tree partitioning problem