On the public citation graph

Generalized Conflict Learning for Hybrid Discrete/Linear Optimization

https://doi.org/10.1007/11564751_32
0 signed · 38 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/11564751_32openalex-snapshot
Generalized Conflict Learning for Hybrid Discrete/Linear Optimization
inferredcites →https://doi.org/10.1007/3-540-61551-2_65openalex-snapshot
Using CSP look-back techniques to solve exceptionally hard SAT instances
inferredcites →https://doi.org/10.1007/978-3-540-45193-8_70openalex-snapshot
Unrestricted Nogood Recording in CSP Search
inferredcites →https://doi.org/10.1007/978-3-540-68279-0_5openalex-snapshot
An Automatic Method for Solving Discrete Programming Problems
inferredcites →https://doi.org/10.1007/b13743openalex-snapshot
Principles and practice of constraint programming - CP 2003 : 9th International Conference, CP 2003, Kinsale, Ireland, September 29 - October 3, 2003 : proceedings
inferredcites →https://doi.org/10.1007/s10107-004-0533-8openalex-snapshot
Safe and tight linear estimators for global optimization
inferredcites →https://doi.org/10.1016/0004-3702(77)90029-7openalex-snapshot
Forward reasoning and dependency-directed backtracking in a system for computer-aided circuit analysis
inferredcites →https://doi.org/10.1016/0004-3702(79)90008-0openalex-snapshot
A truth maintenance system
inferredcites →https://doi.org/10.1016/0004-3702(87)90063-4openalex-snapshot
Diagnosing multiple faults
inferredcites →https://doi.org/10.1016/0004-3702(90)90046-3openalex-snapshot
Enhancement schemes for constraint processing: Backjumping, learning, and cutset decomposition
inferredcites →https://doi.org/10.1016/j.dam.2005.10.022openalex-snapshot
Conflict-directed A* and its role in model-based embedded systems
inferredcites →https://doi.org/10.1016/s0166-218x(99)00100-6openalex-snapshot
Mixed logical-linear programming
inferredcites →https://doi.org/10.1016/s0167-5060(08)70342-xopenalex-snapshot
Disjunctive Programming
inferredcites →https://doi.org/10.1017/s0269888900001065openalex-snapshot
Applying integer programming to AI planning
inferredcites →https://doi.org/10.1017/s0962492904000194openalex-snapshot
Complete search in continuous global optimization and constraint satisfaction
inferredcites →https://doi.org/10.1109/jproc.2002.805828openalex-snapshot
Model-based programming of intelligent embedded systems and robotic space explorers
inferredcites →https://doi.org/10.1111/j.1467-8640.1993.tb00310.xopenalex-snapshot
HYBRID ALGORITHMS FOR THE CONSTRAINT SATISFACTION PROBLEM
inferredcites →https://doi.org/10.1115/1.3256299openalex-snapshot
Monotonicity in Goal and Geometric Programming
inferredcites →https://doi.org/10.1115/1.3454115openalex-snapshot
Global Non-Iterative Design Optimization Using Monotonicity Analysis
inferredcites →https://doi.org/10.1145/1066100.1066102openalex-snapshot
Simplify: a theorem prover for program checking
inferredcites →https://doi.org/10.1145/263407.263518openalex-snapshot
Solving linear arithmetic constraints for user interface applications
inferredcites →https://doi.org/10.1145/361219.361224openalex-snapshot
Backtrack programming techniques
inferredcites →https://doi.org/10.1145/3828.3830openalex-snapshot
Generalized best-first search strategies and the optimality of A*
inferredcites →https://doi.org/10.1287/ijoc.14.4.295.2828openalex-snapshot
Logic, Optimization, and Constraint Programming
inferredcites →https://doi.org/10.1613/jair.1openalex-snapshot
Dynamic Backtracking
inferredcites →https://doi.org/10.23919/ecc.2001.7076321openalex-snapshot
Mixed integer programming for multi-vehicle path planning
inferredcites →https://doi.org/10.5860/choice.35-3926openalex-snapshot
Numerica: a modeling language for global optimization

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11757375_16openalex-snapshot
Conflict-Directed A* Search for Soft Constraints
inferred← citeshttps://doi.org/10.1016/j.dam.2005.10.022openalex-snapshot
Conflict-directed A* and its role in model-based embedded systems
inferred← citeshttps://doi.org/10.1016/j.ic.2020.104637openalex-snapshot
Consistency checking of STNs with decisions: Managing temporal and access-control constraints in a seamless way
inferred← citeshttps://doi.org/10.1109/acc.2006.1656653openalex-snapshot
A probabilistic approach to optimal robust path planning with obstacles
inferred← citeshttps://doi.org/10.1109/acc.2010.5530976openalex-snapshot
Chance constrained finite horizon optimal control with nonconvex constraints
inferred← citeshttps://doi.org/10.1109/acc.2011.5990937openalex-snapshot
Regression-based LP solver for chance-constrained finite horizon optimal control with nonconvex constraints
inferred← citeshttps://doi.org/10.1109/cdc.2010.5717137openalex-snapshot
A cell decomposition approach to cooperative path planning and collision avoidance via disjunctive programming
inferred← citeshttps://doi.org/10.1109/tro.2011.2161160openalex-snapshot
Chance-Constrained Optimal Path Planning With Obstacles
inferred← citeshttps://doi.org/10.1613/jair.3893openalex-snapshot
Probabilistic Planning for Continuous Dynamic Systems under Bounded Risk
inferred← citeshttps://doi.org/10.1613/jair.5431openalex-snapshot
Resolving Over-Constrained Temporal Problems with Uncertainty through Conflict-Directed Relaxation
showing the first 10 of 11 · page through all 11
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.