New filtering for \textsc{AtMostNValue} and its weighted variant: a Lagrangian approach
From MaRDI portal
Publication:890005
Recommendations
- Filtering algorithms for the NValue constraint
- Filtering Algorithms for the NValue Constraint
- Filtering AtMostNValue with difference constraints: application to the shift minimisation personnel task scheduling problem
- Improved filtering for weighted circuit constraints
- Combining Arc-Consistency and Dual Lagrangean Relaxation for Filtering CSPs
Cites work
- A Dual-Based Procedure for Uncapacitated Facility Location
- A Lagrangian Relaxation for Golomb Rulers
- A shortest path-based approach to the multileaf collimator sequencing problem
- Consistency techniques for flow-based projection-safe global cost functions in weighted constraint satisfaction
- Constraint programming based Lagrangian relaxation for the automatic recording problem
- Filtering algorithms for the NValue constraint
- Filtering AtMostNValue with difference constraints: application to the shift minimisation personnel task scheduling problem
- scientific article; zbMATH DE number 3614502 (Why is no real title available?)
- scientific article; zbMATH DE number 1312984 (Why is no real title available?)
- scientific article; zbMATH DE number 2084707 (Why is no real title available?)
- scientific article; zbMATH DE number 1487974 (Why is no real title available?)
- Improved filtering for weighted circuit constraints
- New bundle methods for solving Lagrangian relaxation dual problems
- Personnel scheduling: a literature review
- Principles and Practice of Constraint Programming – CP 2004
- Sequencing and Counting with the multicost-regular Constraint
- Soft arc consistency revisited
- Technical Note—An Algorithm for the p-Median Problem
- The traveling-salesman problem and minimum spanning trees: Part II
Cited in
(7)- Constraint programming and operations research
- Maximal-sum submatrix search using a hybrid constraint programming/linear programming approach
- A Lagrangian propagator for artificial neural networks in constraint programming
- Enriching Solutions to Combinatorial Problems via Solution Engineering
- Filtering Algorithms for the NValue Constraint
- The theory of Lagrangian filtering zones: a case study on the knapsack constraint
- Filtering algorithms for the NValue constraint
This page was built for publication: New filtering for \textsc{AtMostNValue} and its weighted variant: a Lagrangian approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q890005)
