Submodularity and its application to some global constraints
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 4137537
- Minimization of locally defined submodular functions by optimal soft arc consistency
- Classes of submodular constraints expressible by graph cuts
- Submodular set functions and monotone systems in aggregation problems. II
- Applications of relaxed submodularity
Cites work
- scientific article; zbMATH DE number 4089320 (Why is no real title available?)
- scientific article; zbMATH DE number 2080319 (Why is no real title available?)
- scientific article; zbMATH DE number 1550909 (Why is no real title available?)
- scientific article; zbMATH DE number 3422402 (Why is no real title available?)
- A Search-Infer-and-Relax Framework for Integrating Solution Methods
- A polyhedral approach to the \textit{alldifferent} system
- An integrated solver for optimization problems
- Combinatorial Optimization. Polyhedra and efficiency. CD-ROM
- Generalized polymatroids and submodular flows
- Graph coloring inequalities from all-different systems
- Integrated methods for optimization.
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- Mathematical programming techniques in constraint programming: a short overview
- Mixed logical-linear programming
- On the facial structure of the alldifferent system
- On the system of two all different\(\_\)predicates
- Representations of the all\_different predicate of constraint satisfaction in integer programming
- The Linear Programming Polytope of Binary Constraint Problems with Bounded Tree-Width
- Tight representation of logical constraints as cardinality rules
Cited in
(2)
This page was built for publication: Submodularity and its application to some global constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2364363)
