On the public citation graph

Integrating Benders Decomposition Within Constraint Programming

https://doi.org/10.1007/11564751_58
0 signed · 22 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.1007/3-540-45578-7openalex-snapshot
Principles and practice of constraint programming - CP 2001 : 7th International Conference, CP 2001, Paphos, Cyprus, November 26-December 1, 2001 : proceedings
inferredcites →https://doi.org/10.1007/3-540-45578-7_2openalex-snapshot
Branch-and-Check: A Hybrid Framework Integrating Mixed Integer Programming and Constraint Logic Programming
inferredcites →https://doi.org/10.1007/3-540-46135-3openalex-snapshot
Principles and Practice of Constraint Programming - CP 2002
inferredcites →https://doi.org/10.1007/3-540-46135-3_40openalex-snapshot
Constraint Programming Contribution to Benders Decomposition: A Case Study
inferredcites →https://doi.org/10.1007/978-3-540-30201-8_14openalex-snapshot
Decomposition and Learning for a Hard Real Time Task Allocation Problem
inferredcites →https://doi.org/10.1007/978-3-540-30201-8_24openalex-snapshot
A Hybrid Method for Planning and Scheduling
inferredcites →https://doi.org/10.1007/b100482openalex-snapshot
Principles and Practice of Constraint Programming – CP 2004
inferredcites →https://doi.org/10.1007/bf00934810openalex-snapshot
Generalized Benders decomposition
inferredcites →https://doi.org/10.1007/bf01386316openalex-snapshot
Partitioning procedures for solving mixed-variables programming problems
inferredcites →https://doi.org/10.1007/s10107-003-0375-9openalex-snapshot
Logic-based Benders decomposition
inferredcites →https://doi.org/10.1287/ijoc.13.4.258.9733openalex-snapshot
Algorithms for Hybrid MILP/CP Models for a Class of Optimization Problems

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11493853_9openalex-snapshot
Identifying and Exploiting Problem Structures Using Explanation-Based Constraint Programming
inferred← citeshttps://doi.org/10.1007/11757375_8openalex-snapshot
On the Separability of Subproblems in Benders Decompositions
inferred← citeshttps://doi.org/10.1007/978-3-030-54621-2_903-1openalex-snapshot
Logic-Based Benders Decomposition
inferred← citeshttps://doi.org/10.1007/978-3-540-68155-7_6openalex-snapshot
Multi-stage Benders Decomposition for Optimizing Multicore Architectures
inferred← citeshttps://doi.org/10.1007/s10479-008-0383-5openalex-snapshot
On the separability of subproblems in Benders decompositions
inferred← citeshttps://doi.org/10.1007/s10479-010-0718-xopenalex-snapshot
Optimal resource allocation and scheduling for the CELL BE platform
inferred← citeshttps://doi.org/10.1007/s10601-006-9002-8openalex-snapshot
Identifying and Exploiting Problem Structures Using Explanation-based Constraint Programming
inferred← citeshttps://doi.org/10.1007/s11465-010-0106-xopenalex-snapshot
Technology and system of constraint programming for industry production scheduling — Part I: A brief survey and potential directions
inferred← citeshttps://doi.org/10.1051/ro:2007004openalex-snapshot
Des explications pour reconnaître et exploiter les structures cachées d'un problème combinatoire
inferred← citeshttps://doi.org/10.6092/unibo/amsdottorato/2961openalex-snapshot
Hybrid Methods for Resource Allocation and Scheduling Problems in Deterministic and Stochastic Environments
inferred← citeshttps://doi.org/10.70675/c114e648z6977z4245zb479z268c4e1a7a8copenalex-snapshot
Techniques de décisions hiérarchiques pour l’allocation et l’ordonnancement de tâches
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.