Modelling piecewise linear concave costs in a tree partitioning problem

DOI10.1016/0166-218X(92)00168-LMaRDI QIDQ1326744zbMATH OpenOpenAlexFDO

Authors 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

economic lot- sizingpiecewise linear concave cost functionstree partitioning

Mathematics Subject Classification ID

Mixed integer programming (90C11)

Recommendations

• A comparison of mixed-integer programming models for nonconvex piecewise linear cost minimization problems
• Models for representing piecewise linear cost functions
• Lot sizing with piecewise concave production costs
• Mixed-integer models for nonseparable piecewise-linear optimization: unifying framework and extensions
• scientific article; zbMATH DE number 1795722

Cites work

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

Cited in

(8)

• Optimizing constrained subtrees of trees
• An effective logarithmic formulation for piecewise linearization requiring no inequality constraint
• A branch-and-cut algorithm for the stochastic uncapacitated lot-sizing problem
• Minimum Cost Partitions of Trees with Supply and Demand
• Parameterized Minimum Cost Partition of a Tree with Supply and Demand
• A polyhedral study of lot-sizing with supplier selection
• Uncapacitated lot-sizing with buying, sales and backlogging
• Nonconvex, lower semicontinuous piecewise linear optimization

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1326744)