On the public citation graph

Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems

https://doi.org/10.1007/b136920
0 signed · 36 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-7_13openalex-snapshot
A Filtering Algorithm for the Stretch Constraint
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-24664-0_30openalex-snapshot
Stabilization Issues for Constraint Programming Based Column Generation
inferredcites →https://doi.org/10.1007/978-3-540-30201-8_36openalex-snapshot
A Regular Language Membership Constraint for Finite Sequences of Variables
inferredcites →https://doi.org/10.1007/978-3-540-48085-3_19openalex-snapshot
A Framework for Constraint Programming Based Column Generation
inferredcites →https://doi.org/10.1007/bfb0017428openalex-snapshot
A filtering algorithm for global sequencing constraints
inferredcites →https://doi.org/10.1023/b:anor.0000032576.73681.29openalex-snapshot
Solving VRPTWs with Constraint Programming Based Column Generation

What points at this work

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

inferred← citeshttps://doi.org/10.2139/ssrn.3798667openalex-extracted
State-Expanded Network Models for Multi-Activity Shift Scheduling
inferred← citeshttps://doi.org/10.1007/978-1-4419-1644-0_1openalex-snapshot
The Ten Years of CPAIOR: A Success Story
inferred← citeshttps://doi.org/10.1007/978-1-4419-1644-0_4openalex-snapshot
Decomposition Techniques for Hybrid MILP/CP Models applied to Scheduling and Routing Problems
inferred← citeshttps://doi.org/10.1016/j.cie.2025.111351openalex-snapshot
A branch-and-cut algorithm for the integrated employee timetabling and hybrid job-shop scheduling problem with time lags and setup times
inferred← citeshttps://doi.org/10.1016/j.compchemeng.2019.106599openalex-snapshot
Approximation algorithms for process systems engineering
inferred← citeshttps://doi.org/10.1016/j.cor.2011.08.024openalex-snapshot
Modifying lines-of-flight in the planning process for improved maintenance robustness
inferred← citeshttps://doi.org/10.1016/j.cor.2024.106767openalex-snapshot
A distributionally robust optimization model for inventory-transportation integrated optimization problem of petroleum products under uncertainty
inferred← citeshttps://doi.org/10.1016/j.cor.2025.107262openalex-snapshot
An efficient resource utilization and scheduling strategy for in-service aircraft maintenance and operations
inferred← citeshttps://doi.org/10.1016/j.disopt.2008.12.004openalex-snapshot
A Benders approach for computing lower bounds for the mirrored traveling tournament problem
inferred← citeshttps://doi.org/10.1016/j.disopt.2009.05.004openalex-snapshot
Cutting plane algorithms for solving a stochastic edge-partition problem
inferred← citeshttps://doi.org/10.1016/j.ejor.2005.12.028openalex-snapshot
ILP approaches to the blockmodel problem
inferred← citeshttps://doi.org/10.1016/j.ejor.2007.05.046openalex-snapshot
Round robin scheduling – a survey
inferred← citeshttps://doi.org/10.1016/j.ejor.2016.08.024openalex-snapshot
Propagating logic-based Benders’ decomposition approaches for distributed operating room scheduling
inferred← citeshttps://doi.org/10.1016/j.ejor.2019.07.052openalex-snapshot
The Multiple Multidimensional Knapsack with Family-Split Penalties
inferred← citeshttps://doi.org/10.1016/j.ejor.2021.08.047openalex-snapshot
Exact optimization and decomposition approaches for shelf space allocation
inferred← citeshttps://doi.org/10.1016/j.ejor.2022.11.046openalex-snapshot
The international timetabling competition on sports timetabling (ITC2021)
inferred← citeshttps://doi.org/10.1016/j.ejor.2023.06.006openalex-snapshot
Capacity reservation for humanitarian relief: A logic-based Benders decomposition method with subgradient cut
inferred← citeshttps://doi.org/10.1016/j.ejor.2024.02.024openalex-snapshot
The maximum length car sequencing problem
inferred← citeshttps://doi.org/10.1016/j.ejor.2024.09.022openalex-snapshot
Mathematical models based on decision hypergraphs for designing a storage cabinet
inferred← citeshttps://doi.org/10.1016/j.ejor.2024.11.018openalex-snapshot
Last fifty years of integer linear programming: A focus on recent practical advances
inferred← citeshttps://doi.org/10.1016/j.ejor.2024.12.028openalex-snapshot
Multi-activity shift scheduling under uncertainty: The value of shift flexibility
inferred← citeshttps://doi.org/10.1016/j.endm.2014.11.021openalex-snapshot
A Variable Neighborhood Search Method for Solving the Traveling Tournaments Problem
inferred← citeshttps://doi.org/10.1016/j.ijtst.2017.09.001openalex-snapshot
System optimal re-routing transit assignment heuristic: A theoretical framework and large-scale case study
inferred← citeshttps://doi.org/10.1016/j.micpro.2006.02.021openalex-snapshot
A hardware-efficient scheme and FPGA realization for computation of single pair shortest path for a mobile automaton
inferred← citeshttps://doi.org/10.1016/j.tre.2016.10.013openalex-snapshot
Closed-loop coordination of inland vessels operations in large seaports using hybrid logic-based benders decomposition
inferred← citeshttps://doi.org/10.1016/j.tre.2024.103411openalex-snapshot
Scheduling of automated ore terminal operations based on fixed inflow rhythm
inferred← citeshttps://doi.org/10.1016/j.tre.2025.104492openalex-snapshot
Integrated scheduling for ore terminals under cargo flow uncertainty
inferred← citeshttps://doi.org/10.1109/tencon.2009.5396155openalex-snapshot
Hardware architecture for finding shortest paths
inferred← citeshttps://doi.org/10.70675/b2bd12bdz0c54z4b14z9450zd529241890caopenalex-snapshot
Estimer le nombre de solutions sur les contraintes de cardinalité
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.