On the public citation graph
On a Practical, Integer-Linear Programming Model for Delete-Free Tasks and its Use as a Heuristic for Cost-Optimal Planning
0 signed · 48 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/978-3-540-74970-7_46openalex-snapshot
An LP-Based Heuristic for Optimal Planning
inferredcites →https://doi.org/10.1007/978-3-642-04617-9_2openalex-snapshot
Planning with h + in Theory and Practice
inferredcites →https://doi.org/10.1016/0004-3702(94)90081-7openalex-snapshot
The computational complexity of propositional STRIPS planning
inferredcites →https://doi.org/10.1016/j.artint.2006.08.002openalex-snapshot
Planning as satisfiability: parallel plans and algorithms for plan search
inferredcites →https://doi.org/10.1016/j.artint.2010.04.021openalex-snapshot
Optimal admissible composition of abstraction heuristics
inferredcites →https://doi.org/10.1016/j.artint.2012.08.001openalex-snapshot
Planning as satisfiability: Heuristics
inferredcites →https://doi.org/10.1016/j.artint.2014.12.008openalex-snapshot
Red–black planning: A new systematic approach to partial delete relaxation
inferredcites →https://doi.org/10.1016/s0004-3702(01)00108-4openalex-snapshot
Planning as heuristic search
inferredcites →https://doi.org/10.1016/s0004-3702(96)00047-1openalex-snapshot
Fast planning through planning graph analysis
inferredcites →https://doi.org/10.1080/0952813x.2010.490961openalex-snapshot
Transformation of optimal planning problems
inferredcites →https://doi.org/10.1111/j.1467-8640.1995.tb00052.xopenalex-snapshot
COMPLEXITY RESULTS FOR SAS+ PLANNING
inferredcites →https://doi.org/10.1609/aaai.v28i1.9045openalex-snapshot
Cost-Based Query Optimization via AI 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.v21i1.13482openalex-snapshot
A Complete Algorithm for Generating Landmarks
inferredcites →https://doi.org/10.1609/icaps.v21i1.13485openalex-snapshot
The Minimal Seed Set Problem
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.13522openalex-snapshot
Pruning Methods for Optimal Delete-Free Planning
inferredcites →https://doi.org/10.1609/icaps.v22i1.13532openalex-snapshot
Optimal Planning for Delete-Free Tasks with Incremental LM-Cut
inferredcites →https://doi.org/10.1609/icaps.v22i1.13534openalex-snapshot
Minimal Landmarks for Optimal Delete-Free Planning
inferredcites →https://doi.org/10.1609/icaps.v24i1.13621openalex-snapshot
LP-Based Heuristics for Cost-Optimal Planning
inferredcites →https://doi.org/10.1609/icaps.v24i1.13643openalex-snapshot
Flow-Based Heuristics for Optimal Planning: Landmarks and Merges
inferredcites →https://doi.org/10.1613/jair.1698openalex-snapshot
Optiplan: Unifying IP-based and Graph-based Planning
inferredcites →https://doi.org/10.1613/jair.2443openalex-snapshot
Loosely Coupled Formulations for Automated Planning: An Integer Programming Perspective
inferredcites →https://doi.org/10.1613/jair.4277openalex-snapshot
Improving Delete Relaxation Heuristics Through Explicitly Represented Conjunctions
inferredcites →https://doi.org/10.1613/jair.855openalex-snapshot
The FF Planning System: Fast Plan Generation Through Heuristic Search
inferredcites →https://doi.org/10.25904/1912/341openalex-snapshot
Advancing planning-as-satisfiability
inferredcites →https://doi.org/10.3233/978-1-58603-891-5-588openalex-snapshot
Heuristics for Planning with Action Costs Revisited
inferredcites →https://doi.org/10.3233/978-1-60750-606-5-329openalex-snapshot
Strengthening Landmark Heuristics via Hitting Sets
inferredcites →https://doi.org/10.3233/978-1-60750-606-5-335openalex-snapshot
Sound and Complete Landmarks for And/Or Graphs
inferredcites →https://doi.org/10.3233/978-1-61499-419-0-459openalex-snapshot
A Practical, Integer-Linear Programming Model for the Delete-Relaxation in Cost-Optimal Planning
inferredcites →https://doi.org/10.5451/unibas-ep32799openalex-snapshot
Getting the most out of pattern databases for classical planning
inferredcites →https://doi.org/10.5451/unibas-ep37536openalex-snapshot
Linear programming for heuristics in optimal planning
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/s10601-023-09353-4openalex-snapshot
Optimization methods based on decision diagrams for constraint programming, AI planning, and mathematical programming
inferred← citeshttps://doi.org/10.1017/s1471068423000273openalex-snapshot
Capturing (Optimal) Relaxed Plans with Stable and Supported Models of Logic Programs
inferred← citeshttps://doi.org/10.1109/picst57299.2022.10238554openalex-snapshot
Jobs Distribution Task in Computer Networks
inferred← citeshttps://doi.org/10.1609/aaai.v32i1.12082openalex-snapshot
Linear and Integer Programming-Based Heuristics for Cost-Optimal Numeric Planning
inferred← citeshttps://doi.org/10.1609/aaai.v36i9.21228openalex-snapshot
Efficient Encoding of Cost Optimal Delete-Free Planning as SAT
inferred← citeshttps://doi.org/10.1609/icaps.v28i1.13919openalex-snapshot
Compiling Optimal Numeric Planning to Mixed Integer Linear Programming
inferred← citeshttps://doi.org/10.1609/icaps.v29i1.3462openalex-snapshot
Relaxed BDDs: An Admissible Heuristic for Delete-Free Planning Based on a Discrete Relaxation
inferred← citeshttps://doi.org/10.1609/icaps.v31i1.15964openalex-snapshot
LM-cut and Operator Counting Heuristics for Optimal Numeric Planning with Simple Conditions
inferred← citeshttps://doi.org/10.1609/icaps.v32i1.19787openalex-snapshot
Efficient Computation and Informative Estimation of h+ by Integer and Linear Programming
inferred← citeshttps://doi.org/10.1609/icaps.v32i1.19790openalex-snapshot
Admissible Heuristics for Multi-Objective Planning
inferred← citeshttps://doi.org/10.1613/jair.1.11659openalex-snapshot
Solving Delete Free Planning with Relaxed Decision Diagram Based Heuristics
inferred← citeshttps://doi.org/10.1613/jair.1.14034openalex-snapshot
The LM-Cut Heuristic Family for Optimal Numeric Planning with Simple Conditions
inferred← citeshttps://doi.org/10.1613/jair.5225openalex-snapshot
On Hash-Based Work Distribution Methods for Parallel Best-First Search
inferred← citeshttps://doi.org/10.32920/26052505openalex-snapshot
Action Schema Networks for Numerical Planning
inferred← citeshttps://doi.org/10.32920/26052505.v1openalex-snapshot
Action Schema Networks for Numerical 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.