Discrete convexity in joint winner property

DOI10.1016/j.disopt.2018.01.001zbMath1506.90225arXiv1701.07645OpenAlexW3099484964MaRDI QIDQ1662162

Stanislav Živný, Kazuo Murota, Yuni Iwamasa

Publication date: 17 August 2018

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

Full work available at URL: https://arxiv.org/abs/1701.07645

zbMATH Keywords

discrete convex analysisvalued constraint satisfaction problemsM-convexity

Mathematics Subject Classification ID

Convex programming (90C25) Combinatorial optimization (90C27)

Related Items

Beyond JWP: A Tractable Class of Binary VCSPs via M-Convex Intersection., The quadratic M-convexity testing problem, A Tractable Class of Binary VCSPs via M-Convex Intersection

Cites Work

• Unnamed Item
• Hybrid tractability of valued constraint problems
• Some simplified NP-complete graph problems
• \(M\)-convex functions and tree metrics
• Verifying gross substitutability.
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• A robust model for finding optimal evolutionary tree
• M-Convex Function on Generalized Polymatroid
• Tractable Triangles and Cross-Free Convexity in Discrete Optimisation
• Recent Developments in Discrete Convex Analysis
• Discrete Convex Analysis
• Scheduling independent tasks to reduce mean finishing time
• The Complexity of Valued Constraint Satisfaction Problems
• Fibonacci heaps and their uses in improved network optimization algorithms
• GROSS SUBSTITUTES CONDITION AND DISCRETE CONCAVITY FOR MULTI-UNIT VALUATIONS: A SURVEY
• Technical Note—Minimizing Average Flow Time with Parallel Machines
• Matrices and matroids for systems analysis