Piecewise linear valued constraint satisfaction problems with fixed number of variables

DOI10.1007/978-3-030-63072-0_21zbMath1481.90270arXiv2003.00963OpenAlexW3007071276MaRDI QIDQ2056915

Marcello Mamino, Caterina Viola, Manuel Bodirsky

Publication date: 8 December 2021

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

zbMATH Keywords

linear programmingvalued constraint satisfactionpiecewise linear cost functionsfixed dimensioninfinite-domain optimisation

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Cites Work

• Unnamed Item
• A new polynomial-time algorithm for linear programming
• A unifying approach to temporal constraint reasoning
• Integer optimization on convex semialgebraic sets
• Integer Programming with a Fixed Number of Variables
• Algebraic Properties of Valued Constraint Satisfaction Problem
• Non-dichotomies in Constraint Satisfaction Complexity
• Linear Programming in Linear Time When the Dimension Is Fixed
• Variational Analysis
• The interior-point revolution in optimization: History, recent developments, and lasting consequences
• Constraint Satisfaction Problems over Numeric Domains
• Reducibility among Combinatorial Problems
• The Power of Linear Programming for General-Valued CSPs
• The Complexity of General-Valued CSPs

This page was built for publication: Piecewise linear valued constraint satisfaction problems with fixed number of variables