On the public citation graph

A filtering algorithm for global sequencing constraints

0 signed · 79 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1016/0004-3702(77)90007-8openalex-snapshot
Consistency in networks of relations
inferredcites →https://doi.org/10.1016/0004-3702(92)90020-xopenalex-snapshot
A generic arc-consistency algorithm and its specializations
inferredcites →https://doi.org/10.1016/0895-7177(94)90127-9openalex-snapshot
Introducing global constraints in CHIP
inferredcites →https://doi.org/10.1016/0898-1221(96)90036-xopenalex-snapshot
Logic programming: Proceedings of the 1995 international symposium
inferredcites →https://doi.org/10.6100/ir431902openalex-snapshot
Time and resource constrained scheduling : a constraint satisfaction approach

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/0-387-22827-6_3openalex-snapshot
Constraint Languages for Combinatorial Optimization
inferred← citeshttps://doi.org/10.1007/11493853_12openalex-snapshot
Constraint Programming Based Column Generation for Employee Timetabling
inferred← citeshttps://doi.org/10.1007/11493853_22openalex-snapshot
Combination of Among and Cardinality Constraints
inferred← citeshttps://doi.org/10.1007/11564751_78openalex-snapshot
Solving the Car-Sequencing Problem as a Non-binary CSP
inferred← citeshttps://doi.org/10.1007/11589990_100openalex-snapshot
The Car-Sequencing Problem as n-Ary CSP – Sequential and Parallel Solving
inferred← citeshttps://doi.org/10.1007/11889205_44openalex-snapshot
Revisiting the Sequence Constraint
inferred← citeshttps://doi.org/10.1007/3-540-36605-9_23openalex-snapshot
A Study of Greedy, Local Search, and Ant Colony Optimization Approaches for Car Sequencing Problems
inferred← citeshttps://doi.org/10.1007/3-540-45153-6_9openalex-snapshot
Constraint-Based Vehicle Assembly Line Sequencing
inferred← citeshttps://doi.org/10.1007/3-540-45578-7_13openalex-snapshot
A Filtering Algorithm for the Stretch Constraint
inferred← citeshttps://doi.org/10.1007/3-540-49481-2_8openalex-snapshot
Global Constraints for Partial CSPs: A Case-Study of Resource and Due Date Constraints
inferred← citeshttps://doi.org/10.1007/978-1-4419-1644-0_3openalex-snapshot
Global Constraints: A Survey
inferred← citeshttps://doi.org/10.1007/978-1-4419-8917-8_4openalex-snapshot
Global Constraints and Filtering Algorithms
inferred← citeshttps://doi.org/10.1007/978-1-84882-215-3_16openalex-snapshot
A Hybrid Constraint Programming Approach for Nurse Rostering Problems
inferred← citeshttps://doi.org/10.1007/978-3-030-00256-5_15openalex-snapshot
Optimal General Matchings
inferred← citeshttps://doi.org/10.1007/978-3-319-07046-9_19openalex-snapshot
SAT and Hybrid Models of the Car Sequencing Problem
inferred← citeshttps://doi.org/10.1007/978-3-319-23350-5_8openalex-snapshot
Tabu Search Approaches for Two Car Sequencing Problems with Smoothing Constraints
inferred← citeshttps://doi.org/10.1007/978-3-319-66158-2_6openalex-snapshot
Conjunctions of Among Constraints
inferred← citeshttps://doi.org/10.1007/978-3-319-66158-2_8openalex-snapshot
Arc Consistency via Linear Programming
inferred← citeshttps://doi.org/10.1007/978-3-540-24664-0_16openalex-snapshot
Combining Forces to Solve the Car Sequencing Problem
inferred← citeshttps://doi.org/10.1007/978-3-540-24725-8_8openalex-snapshot
From Constraints to Finite Automata to Filtering Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-540-30201-8_23openalex-snapshot
A Domain Consistency Algorithm for the Stretch Constraint
inferred← citeshttps://doi.org/10.1007/978-3-540-30201-8_40openalex-snapshot
Improved Algorithms for the Global Cardinality Constraint
inferred← citeshttps://doi.org/10.1007/978-3-540-45193-8_11openalex-snapshot
hibiscus: A Constraint Programming Application to Staff Scheduling in Health Care
inferred← citeshttps://doi.org/10.1007/978-3-540-45193-8_41openalex-snapshot
An Efficient Bounds Consistency Algorithm for the Global Cardinality Constraint
inferred← citeshttps://doi.org/10.1007/978-3-540-48085-3_24openalex-snapshot
Automatic Generation of Music Programs
inferred← citeshttps://doi.org/10.1007/978-3-540-74970-7_17openalex-snapshot
Encodings of the Sequence Constraint
inferred← citeshttps://doi.org/10.1007/978-3-540-85958-1_11openalex-snapshot
Flow-Based Propagators for the SEQUENCE and Related Global Constraints
inferred← citeshttps://doi.org/10.1007/978-3-540-87527-7_8openalex-snapshot
Integration of ACO in a Constraint Programming Language
inferred← citeshttps://doi.org/10.1007/978-3-540-89812-2_9openalex-snapshot
Generalizing Global Constraints Based on Network Flows
inferred← citeshttps://doi.org/10.1007/978-3-642-01929-6_14openalex-snapshot
Sequencing and Counting with the multicost-regular Constraint
inferred← citeshttps://doi.org/10.1007/978-3-642-29828-8_10openalex-snapshot
Explaining Flow-Based Propagation
inferred← citeshttps://doi.org/10.1007/978-3-642-33558-7_7openalex-snapshot
An Optimal Arc Consistency Algorithm for a Chain of Atmost Constraints with Cardinality
inferred← citeshttps://doi.org/10.1007/b136920openalex-snapshot
Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
inferred← citeshttps://doi.org/10.1007/s10033-017-0083-7openalex-snapshot
Parallel Construction Heuristic Combined with Constraint Propagation for the Car Sequencing Problem
inferred← citeshttps://doi.org/10.1007/s10479-007-0278-xopenalex-snapshot
A Beam Search approach for the optimization version of the Car Sequencing Problem
inferred← citeshttps://doi.org/10.1007/s10479-008-0384-4openalex-snapshot
The timetable constrained distance minimization problem
inferred← citeshttps://doi.org/10.1007/s10601-005-0552-yopenalex-snapshot
An Efficient Bounds Consistency Algorithm for the Global Cardinality Constraint
inferred← citeshttps://doi.org/10.1007/s10601-006-9009-1openalex-snapshot
Arc-B-consistency of the Inter-distance Constraint
inferred← citeshttps://doi.org/10.1007/s10601-006-9011-7openalex-snapshot
Models for Global Constraint Applications
inferred← citeshttps://doi.org/10.1007/s10601-008-9067-7openalex-snapshot
New filtering algorithms for combinations of among constraints
inferred← citeshttps://doi.org/10.1007/s10601-013-9150-6openalex-snapshot
An optimal arc consistency algorithm for a particular case of sequence constraint
inferred← citeshttps://doi.org/10.1007/s10601-015-9201-2openalex-snapshot
Projection, consistency, and George Boole
inferred← citeshttps://doi.org/10.1007/s10852-012-9174-8openalex-snapshot
Weight-based Heuristics for Constraint Satisfaction and Combinatorial Optimization Problems
inferred← citeshttps://doi.org/10.1007/s10951-007-0046-4openalex-snapshot
A GRASP approach for the extended car sequencing problem
inferred← citeshttps://doi.org/10.1016/j.artint.2010.10.005openalex-snapshot
The extended global cardinality constraint: An empirical survey
inferred← citeshttps://doi.org/10.1016/j.artint.2012.05.001openalex-snapshot
Filtering algorithms for global chance constraints
inferred← citeshttps://doi.org/10.1016/j.artint.2017.07.001openalex-snapshot
Automatically improving constraint models in Savile Row
inferred← citeshttps://doi.org/10.1016/j.ejor.2007.04.043openalex-snapshot
Two local search approaches for solving real-life car sequencing problems
inferred← citeshttps://doi.org/10.1016/j.ejor.2007.09.013openalex-snapshot
Sequencing mixed-model assembly lines: Survey, classification and model critique
inferred← citeshttps://doi.org/10.1016/j.engappai.2014.10.009openalex-snapshot
A study of constraint programming heuristics for the car-sequencing problem
inferred← citeshttps://doi.org/10.1016/j.procir.2018.03.127openalex-snapshot
Implications of agile manufacturing in the automotive industry for order management in the factories-evidence from the practitioner’s perspective
inferred← citeshttps://doi.org/10.1016/j.procir.2026.01.022openalex-snapshot
An integrated re-planning ILP approach on the production capacity and sequence in the automotive industry.
inferred← citeshttps://doi.org/10.1016/s0004-3702(02)00263-1openalex-snapshot
On forward checking for non-binary constraint satisfaction
inferred← citeshttps://doi.org/10.1016/s0377-2217(98)00364-6openalex-snapshot
Constraint satisfaction problems: Algorithms and applications
inferred← citeshttps://doi.org/10.1016/s1574-6526(06)80015-5openalex-snapshot
Modelling
inferred← citeshttps://doi.org/10.1016/s1574-6526(06)80021-0openalex-snapshot
Constraints over Structured Domains
inferred← citeshttps://doi.org/10.1023/a:1021153305410openalex-snapshot
A General Approach to the Physician Rostering Problem
inferred← citeshttps://doi.org/10.1051/ro:2007003openalex-snapshot
Large neighborhood improvements for solving car sequencing problems
inferred← citeshttps://doi.org/10.1057/palgrave.jors.2601789openalex-snapshot
A general multi-shift scheduling system
inferred← citeshttps://doi.org/10.1057/palgrave.jors.2601955openalex-snapshot
Review and comparison of three methods for the solution of the car sequencing problem
inferred← citeshttps://doi.org/10.1109/93.839310openalex-snapshot
A combinatorial approach to content-based music selection
inferred← citeshttps://doi.org/10.1109/mmcs.1999.779245openalex-snapshot
A combinatorial approach to content-based music selection
inferred← citeshttps://doi.org/10.1109/tai.1998.744878openalex-snapshot
Encoding global constraints in semiring-based constraint solving
inferred← citeshttps://doi.org/10.1145/2001576.2001599openalex-snapshot
Car sequencing with constraint-based ACO
inferred← citeshttps://doi.org/10.1522/030084689openalex-snapshot
Algorithmes evolutionnaires pour l'ordonnancement industriel :
inferred← citeshttps://doi.org/10.1522/24109603openalex-snapshot
Algorithme de fourmis avec apprentissage et comportement specialises pour l'ordonnancement de voitures /
inferred← citeshttps://doi.org/10.1613/jair.4199openalex-snapshot
MDD Propagation for Sequence Constraints
inferred← citeshttps://doi.org/10.20868/upm.thesis.39672openalex-snapshot
Analysing the complexity of the model-based decision making processes within the industrial management context
inferred← citeshttps://doi.org/10.24425/acs.2019.130203openalex-snapshot
Buffer management in solving a real sequencing problem in the automotive industry – Paint Shop 4.0 concept
inferred← citeshttps://doi.org/10.29007/jrspopenalex-snapshot
SAT Encodings for the Car Sequencing Problem
inferred← citeshttps://doi.org/10.4995/ijpme.2014.1838openalex-snapshot
MILP for the Inventory and Routing for Replenishment Problem in the Car Assembly Line.
inferred← citeshttps://doi.org/10.4995/ijpme.2021.14985openalex-snapshot
Integrating Tier-1 module suppliers in car sequencing problem
inferred← citeshttps://doi.org/10.70675/46030674z0805z4c8az9609zbb07ec370ff3openalex-snapshot
Constraint games revisited
inferred← citeshttps://doi.org/10.70675/d6cf375fz03f4z432ezb038z4ed4d48b08d3openalex-snapshot
Search, propagation, and learning in sequencing and scheduling problems
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.