On the public citation graph
Loosely Coupled Formulations for Automated Planning: An Integer Programming Perspective
0 signed · 34 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/10720246_11openalex-snapshot
Exhibiting Knowledge in Planning Problems to Minimize State Encoding Length
inferredcites →https://doi.org/10.1007/10720246_19openalex-snapshot
Integer Programs and Valid Inequalities for Planning Problems
inferredcites →https://doi.org/10.1007/3-540-63912-8_84openalex-snapshot
Encoding planning problems in nonmonotonic logic programs
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/bf02579150openalex-snapshot
A new polynomial-time algorithm for linear programming
inferredcites →https://doi.org/10.1016/0167-6377(91)90028-nopenalex-snapshot
Using separation algorithms to generate mixed integer model reformulations
inferredcites →https://doi.org/10.1016/0167-9236(88)90097-8openalex-snapshot
A quantitative approach to logical inference
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.tcs.2006.08.002openalex-snapshot
Categorical proof theory of classical propositional calculus
inferredcites →https://doi.org/10.1016/s0004-3702(01)00082-0openalex-snapshot
Least commitment in Graphplan
inferredcites →https://doi.org/10.1016/s0004-3702(01)00122-9openalex-snapshot
Planning the project management way: Efficient planning by effective integration of causal and resource reasoning in RealPlan
inferredcites →https://doi.org/10.1111/j.1467-8640.1995.tb00052.xopenalex-snapshot
COMPLEXITY RESULTS FOR SAS+ PLANNING
inferredcites →https://doi.org/10.1137/1033004openalex-snapshot
A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
inferredcites →https://doi.org/10.1145/800057.808695openalex-snapshot
A new polynomial-time algorithm for linear programming
inferredcites →https://doi.org/10.1287/ijoc.12.1.2.11900openalex-snapshot
Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition
inferredcites →https://doi.org/10.1287/opre.32.6.1195openalex-snapshot
A Cutting Plane Algorithm for the Linear Ordering Problem
inferredcites →https://doi.org/10.1287/opre.50.1.3.17780openalex-snapshot
Solving Real-World Linear Programs: A Decade and More of Progress
inferredcites →https://doi.org/10.1613/jair.1698openalex-snapshot
Optiplan: Unifying IP-based and Graph-based Planning
inferredcites →https://doi.org/10.21236/ada303260openalex-snapshot
Fast Planning Through Planning Graph Analysis.
inferredcites →https://doi.org/10.2307/3010676openalex-snapshot
Annotated Bibliographies in Combinatorial 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/978-3-319-17665-9_4openalex-snapshot
Methodological Background
inferred← citeshttps://doi.org/10.1007/s10472-011-9265-7openalex-snapshot
Experimental evaluation of pheromone models in ACOPlan
inferred← citeshttps://doi.org/10.1016/j.oceaneng.2024.117104openalex-snapshot
Temporal mission planning for autonomous ships: Design and integration with guidance, navigation and control
inferred← citeshttps://doi.org/10.1016/j.proeng.2012.01.492openalex-snapshot
Boost the Integration of Planning and Scheduling: a Heuristics Approach
inferred← citeshttps://doi.org/10.1080/0952813x.2010.490961openalex-snapshot
Transformation of optimal planning problems
inferred← citeshttps://doi.org/10.1093/logcom/exq023openalex-snapshot
Introducing Preferences in Planning as Satisfiability
inferred← citeshttps://doi.org/10.1609/icaps.v20i1.13401openalex-snapshot
Handling Goal Utility Dependencies in a Satisfiability Framework
inferred← citeshttps://doi.org/10.1613/jair.3788openalex-snapshot
Incremental Clustering and Expansion for Faster Optimal Planning in Decentralized POMDPs
inferred← citeshttps://doi.org/10.1613/jair.4936openalex-snapshot
On a Practical, Integer-Linear Programming Model for Delete-Free Tasks and its Use as a Heuristic for Cost-Optimal Planning
inferred← citeshttps://doi.org/10.18090/samriddhi.v15i01.14openalex-snapshot
Modeling of Transport Problem in Linear Programming with Python (PULP)
inferred← citeshttps://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
inferred← citeshttps://doi.org/10.3233/aic-2012-0540openalex-snapshot
Planning as satisfiability with IPC simple preferences and action costs
inferred← citeshttps://doi.org/10.48456/tr-822openalex-snapshot
Planning with preferences using maximum satisfiability
inferred← citeshttps://doi.org/10.48550/arxiv.1703.03916openalex-snapshot
Axioms in Model-based Planners
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.