Submodular reassignment problem for reallocating agents to tasks with synergy effects

DOI10.1016/j.disopt.2021.100631OpenAlexW3133678828MaRDI QIDQ2673247

Naoyuki Kamiyama, Yusuke Kobayashi, Naonori Kakimura, Yoshio Okamoto

Publication date: 9 June 2022

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disopt.2021.100631

zbMATH Keywords

stochastic optimizationminimum cutsubmodular functiondistributive latticeBirkhoff's representation theorem

Mathematics Subject Classification ID

Stochastic programming (90C15) Combinatorial optimization (90C27)

Cites Work

• Unnamed Item
• Steiner tree reoptimization in graphs with sharpened triangle inequality
• A note on the traveling salesman reoptimization problem under vertex insertion
• On covering problems of codes
• Erratum to: ``Computational complexity of stochastic programming problems
• Fast reoptimization for the minimum spanning tree problem
• A faster strongly polynomial time algorithm for submodular function minimization
• Computational complexity of stochastic programming problems
• Improved approximations for two-stage MIN-cut and shortest path problems under uncertainty
• Cores of convex games
• Area-Universal and Constrained Rectangular Layouts
• Introduction to Stochastic Programming
• Approximation algorithms for the sex-equal stable marriage problem
• An approximation scheme for stochastic linear programming and its application to stochastic integer programs
• Lectures on Stochastic Programming
• On the structure of all minimum cuts in a network and applications
• Maximal Closure of a Graph and Applications to Combinatorial Problems
• The Complexity of Multiterminal Cuts
• Discrete Convex Analysis
• Minimum Cuts and Sparsification in Hypergraphs
• Approximation Algorithms for Stochastic and Risk-Averse Optimization
• Max flows in O(nm) time, or better

This page was built for publication: Submodular reassignment problem for reallocating agents to tasks with synergy effects