Sharing problems

DOI10.1080/02331938608843101MaRDI QIDQ3720309zbMATH OpenOpenAlexFDO

Authors 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

dualityduality theoryknapsackminimax problemquasiconvex functionssharing problemscovering constraintssubmodular flowtotally ordered setconvex sharing

Mathematics Subject Classification ID

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

Recommendations

• Linear and combinatorial sharing problems
• The Linear Sharing Problem
• Solving knapsack sharing problems with general tradeoff functions
• Bounded knapsack sharing
• scientific article; zbMATH DE number 1070375

Cites work

• scientific article; zbMATH DE number 3744939 (Why is no real title available?)
• scientific article; zbMATH DE number 3323651 (Why is no real title available?)
• Discrete and nondlscrete quasi eon vexlike functions and single-peakedness (unimodality)
• Linear and combinatorial sharing problems
• Minimization on submodular flows
• Quasi-Convex Programming
• Structures of polyhedra determined by submodular functions on crossing families
• Technical Note—Integer Allocation Problems of Min-Max Type with Quasiconvex Separable Functions

Cited in

(4)

• Duality for balanced submodular flows
• Linear and combinatorial sharing problems
• Reshipments and overshipments in transportation problems with minimax objective
• scientific article; zbMATH DE number 936866 (Why is no real title available?)

This page was built for publication: Sharing problems

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