On the public citation graph

A Search-Infer-and-Relax Framework for Integrating Solution Methods

https://doi.org/10.1007/11493853_19
0 signed · 41 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.1002/9781118033036openalex-snapshot
Logic‐Based Methods for Optimization
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_1openalex-snapshot
Hybrid Benders Decomposition Algorithms in Constraint Logic Programming
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-58601-6_105openalex-snapshot
GSAT and dynamic backtracking
inferredcites →https://doi.org/10.1007/3-540-58601-6_111openalex-snapshot
Logic-based methods for optimization
inferredcites →https://doi.org/10.1007/978-1-4615-1043-7_1openalex-snapshot
A Framework for Integrating Solution Methods
inferredcites →https://doi.org/10.1007/978-1-4757-2807-1_1openalex-snapshot
Constraint Satisfaction Methods for Generating Valid Cuts
inferredcites →https://doi.org/10.1007/978-1-4757-3532-1openalex-snapshot
Convexification and Global Optimization in Continuous and Mixed-Integer Nonlinear Programming
inferredcites →https://doi.org/10.1007/978-3-540-24664-0_2openalex-snapshot
SIMPL: A System for Integrating Optimization Techniques
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.1007/s10287-004-0020-yopenalex-snapshot
Partitioning procedures for solving mixed-variables programming problems
inferredcites →https://doi.org/10.1016/s0166-218x(99)00100-6openalex-snapshot
Mixed logical-linear programming
inferredcites →https://doi.org/10.1017/cbo9780511569975openalex-snapshot
Acta Numerica 2004
inferredcites →https://doi.org/10.1017/s0269888900001077openalex-snapshot
A scheme for unifying optimization and constraint satisfaction methods
inferredcites →https://doi.org/10.1017/s0962492904000194openalex-snapshot
Complete search in continuous global optimization and constraint satisfaction
inferredcites →https://doi.org/10.1109/12.769433openalex-snapshot
GRASP: a search algorithm for propositional satisfiability
inferredcites →https://doi.org/10.1145/378239.379017openalex-snapshot
Chaff
inferredcites →https://doi.org/10.1287/ijoc.10.3.287openalex-snapshot
Branch and Infer: A Unifying Framework for Integer and Finite Domain Constraint Programming
inferredcites →https://doi.org/10.1287/ijoc.13.4.258.9733openalex-snapshot
Algorithms for Hybrid MILP/CP Models for a Class of Optimization Problems
inferredcites →https://doi.org/10.1613/jair.1openalex-snapshot
Dynamic Backtracking
inferredcites →https://doi.org/10.5860/choice.38-3939openalex-snapshot
Logic-based methods for optimization: combining optimization and constraint satisfaction

What points at this work

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

inferred← citeshttps://doi.org/10.1007/978-0-387-88617-6_11openalex-snapshot
Logic-based MultiObjective Optimization for Restoration Planning
inferred← citeshttps://doi.org/10.1007/978-3-540-68155-7_13openalex-snapshot
The Accuracy of Search Heuristics: An Empirical Study on Knapsack Problems
inferred← citeshttps://doi.org/10.1007/978-3-540-78295-7_3openalex-snapshot
The Relation Between Complete and Incomplete Search
inferred← citeshttps://doi.org/10.1007/978-3-642-29828-8_12openalex-snapshot
A High Level Language for Solver Independent Model Manipulation and Generation of Hybrid Solvers
inferred← citeshttps://doi.org/10.1007/s10107-010-0390-6openalex-snapshot
A polyhedral approach to the alldifferent system
inferred← citeshttps://doi.org/10.1007/s10472-016-9522-xopenalex-snapshot
Submodularity and its application to some global constraints
inferred← citeshttps://doi.org/10.1016/s1574-6526(06)80019-2openalex-snapshot
Operations Research Methods in Constraint Programming
inferred← citeshttps://doi.org/10.1016/s1574-6526(06)x8001-xopenalex-snapshot
Handbook of Constraint Programming
inferred← citeshttps://doi.org/10.1145/2491845.2491847openalex-snapshot
The constraint of difference and total dual integrality
inferred← citeshttps://doi.org/10.1287/ijoc.2015.0664openalex-snapshot
Modeling with Metaconstraints and Semantic Typing of Variables
inferred← citeshttps://doi.org/10.1287/opre.1090.0733openalex-snapshot
An Integrated Solver for Optimization Problems
inferred← citeshttps://doi.org/10.1613/jair.5378openalex-snapshot
Encoding Domain Transitions for Constraint-Based Planning
inferred← citeshttps://doi.org/10.3233/978-1-60750-606-5-453openalex-snapshot
Constraint Based Planning with Composable Substate Graphs
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.