Sharing problems

DOI10.1080/02331938608843101zbMath0591.90074OpenAlexW4247036234MaRDI QIDQ3720309

Uwe T. Zimmermann

Publication date: 1986

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331938608843101

zbMATH Keywords

dualityquasiconvex functionsminimax problemduality theoryknapsacksharing problemscovering constraintssubmodular flowtotally ordered setconvex sharing

Mathematics Subject Classification ID

Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37) Duality theory (optimization) (49N15)

Related Items (2)

Reshipments and overshipments in transportation problems with minimax objective ⋮ Duality for balanced submodular flows

Cites Work

• Unnamed Item
• Unnamed Item
• Linear and combinatorial sharing problems
• Minimization on submodular flows
• Structures of polyhedra determined by submodular functions on crossing families
• Discrete and nondlscrete quasi eon vexlike functions and single-peakedness (unimodality)
• Technical Note—Integer Allocation Problems of Min-Max Type with Quasiconvex Separable Functions
• Quasi-Convex Programming

This page was built for publication: Sharing problems