On the public citation graph

Continuing Plan Quality Optimisation

0 signed · 51 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.1006/jcph.1999.6413openalex-snapshot
Record Breaking Optimization Results Using the Ruin and Recreate Principle
inferredcites →https://doi.org/10.1007/3-540-49481-2_30openalex-snapshot
Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems
inferredcites →https://doi.org/10.1007/978-3-642-35101-3_68openalex-snapshot
Block-Structured Plan Deordering
inferredcites →https://doi.org/10.1007/bfb0052953openalex-snapshot
Complete determination of parallel actions and temporal optimization in linear plans of action
inferredcites →https://doi.org/10.1016/0004-3702(70)90007-xopenalex-snapshot
Heuristic search viewed as path finding in a graph
inferredcites →https://doi.org/10.1016/0004-3702(87)90092-0openalex-snapshot
Planning for conjunctive goals
inferredcites →https://doi.org/10.1016/0004-3702(94)90005-1openalex-snapshot
On the computational complexity of temporal projection, planning, and plan validation
inferredcites →https://doi.org/10.1016/0004-3702(94)90011-6openalex-snapshot
A unified framework for explanation-based generalization of partially ordered and partially instantiated plans
inferredcites →https://doi.org/10.1016/b978-0-934613-30-9.50006-8openalex-snapshot
FORMULATING MULTIAGENT, DYNAMIC-WORLD PROBLEMS IN THE CLASSICAL PLANNING FRAMEWORK
inferredcites →https://doi.org/10.1016/j.tcs.2009.01.016openalex-snapshot
Exploration–exploitation tradeoff using variance estimates in multi-armed bandits
inferredcites →https://doi.org/10.1016/s0004-3702(01)00108-4openalex-snapshot
Planning as heuristic search
inferredcites →https://doi.org/10.1023/a:1013689704352openalex-snapshot
Finite-time Analysis of the Multiarmed Bandit Problem
inferredcites →https://doi.org/10.1090/s0002-9904-1952-09620-8openalex-snapshot
Some aspects of the sequential design of experiments
inferredcites →https://doi.org/10.1137/0135023openalex-snapshot
A Consistent Extension of Condorcet’s Election Principle
inferredcites →https://doi.org/10.1145/1273496.1273587openalex-snapshot
Multi-armed bandit problems with dependent arms
inferredcites →https://doi.org/10.1145/371920.372165openalex-snapshot
Rank aggregation methods for the Web
inferredcites →https://doi.org/10.1184/r1/6607754openalex-snapshot
Nonlinear Planning with Parallel Resource Allocation
inferredcites →https://doi.org/10.1287/ijoc.1060.0193openalex-snapshot
A Very Large-Scale Neighborhood Search Algorithm for the Combined Through-Fleet-Assignment Model
inferredcites →https://doi.org/10.1287/trsc.1050.0135openalex-snapshot
An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows
inferredcites →https://doi.org/10.1609/aimag.v33i1.2392openalex-snapshot
A Survey of the Seventh International Planning Competition
inferredcites →https://doi.org/10.1609/icaps.v19i1.13345openalex-snapshot
Preferred Operators and Deferred Evaluation in Satisficing Planning
inferredcites →https://doi.org/10.1609/icaps.v19i1.13370openalex-snapshot
Landmarks, Critical Paths and Abstractions: What's the Difference Anyway?
inferredcites →https://doi.org/10.1609/icaps.v19i1.13386openalex-snapshot
An Automatically Configurable Portfolio-based Planner with Macro-actions: PbP
inferredcites →https://doi.org/10.1609/icaps.v20i1.13402openalex-snapshot
Action Elimination and Plan Neighborhood Graph Search: Two Algorithms for Plan Improvement
inferredcites →https://doi.org/10.1609/icaps.v20i1.13412openalex-snapshot
The Joy of Forgetting: Faster Anytime Search via Restarting
inferredcites →https://doi.org/10.1609/icaps.v21i1.13455openalex-snapshot
Potential Search: A Bounded-Cost Search Algorithm
inferredcites →https://doi.org/10.1609/icaps.v22i1.13502openalex-snapshot
Planning Via Random Walk-Driven Local Search
inferredcites →https://doi.org/10.1609/icaps.v22i1.13511openalex-snapshot
Incremental Lower Bounds for Additive Cost Planning Problems
inferredcites →https://doi.org/10.1609/icaps.v22i1.13537openalex-snapshot
Optimally Relaxing Partial-Order Plans with MaxSAT
inferredcites →https://doi.org/10.1609/icaps.v23i1.13543openalex-snapshot
Better Time Constrained Search via Randomization and Postprocessing
inferredcites →https://doi.org/10.1609/socs.v3i1.18242openalex-snapshot
Better Parameter-Free Anytime Search by Minimizing Time Between Solutions
inferredcites →https://doi.org/10.1609/socs.v3i1.18260openalex-snapshot
On Improving Plan Quality via Local Enhancements
inferredcites →https://doi.org/10.1613/jair.2861openalex-snapshot
ParamILS: An Automatic Algorithm Configuration Framework
inferredcites →https://doi.org/10.1613/jair.477openalex-snapshot
Computational Aspects of Reordering Plans
inferredcites →https://doi.org/10.1613/jair.754openalex-snapshot
Planning by Rewriting
inferredcites →https://doi.org/10.1613/jair.855openalex-snapshot
The FF Planning System: Fast Plan Generation Through Heuristic Search
inferredcites →https://doi.org/10.48550/arxiv.0907.3986openalex-snapshot
Contextual Bandits with Similarity Information
inferredcites →https://doi.org/10.48550/arxiv.1102.2490openalex-snapshot
The KL-UCB Algorithm for Bounded Stochastic Bandits and Beyond
inferredcites →https://doi.org/10.48550/arxiv.1410.4391openalex-snapshot
Multivariate Spearman's rho for aggregating ranks using copulas
inferredcites →https://doi.org/10.5555/2627435.2670330openalex-snapshot
Contextual bandits with similarity information
inferredcites →https://doi.org/10.5591/978-1-57735-516-8/ijcai11-119openalex-snapshot
Bounded suboptimal search: a direct approach using inadmissible estimates

What points at this work

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

inferred← citeshttps://doi.org/10.1002/aaai.12073openalex-snapshot
Hierarchical planning and reasoning about partially ordered plans—From theory to practice
inferred← citeshttps://doi.org/10.1609/aaai.v31i1.11025openalex-snapshot
Plan Reordering and Parallel Execution — A Parameterized Complexity View
inferred← citeshttps://doi.org/10.1609/aaai.v34i06.6530openalex-snapshot
POP ≡ POCL, Right? Complexity Results for Partial Order (Causal Link) Makespan Minimization
inferred← citeshttps://doi.org/10.1609/icaps.v29i1.3493openalex-snapshot
Eliminating Redundant Actions in Partially Ordered Plans — A Complexity Analysis
inferred← citeshttps://doi.org/10.1609/icaps.v30i1.6687openalex-snapshot
An AI-Based Planning Framework for HAPS in a Time-Varying Environment
inferred← citeshttps://doi.org/10.1609/icaps.v32i1.19808openalex-snapshot
On Speeding Up Methods for Identifying Redundant Actions in Plans
inferred← citeshttps://doi.org/10.1609/icaps.v32i1.19820openalex-snapshot
Debugging a Policy: Automatic Action-Policy Testing in AI Planning
inferred← citeshttps://doi.org/10.24963/kr.2023/80openalex-snapshot
Eliminating Redundant Actions from Plans Using Classical Planning
inferred← citeshttps://doi.org/10.25911/5d6c3a9454f26openalex-snapshot
Using Plan Decomposition for Continuing Plan Optimisation and Macro Generation
inferred← citeshttps://doi.org/10.3233/aic-230058openalex-snapshot
Revisiting block deordering in finite-domain state variable planning
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.