View Document Preview and Link Document Date: 2012-10-29 18:16:32 Open Document File Size: 212,95 KB Share Result on Facebook
City Mountain View / / Company John Wiley and Sons. / IP / ILOG Inc. / Boulder CO / / / Event Reorganization / / Facility Business Arizona State University University of Colorado / / IndustryTerm branchand-bound algorithms / defined network / plan solution / search performance / change network / heuristic search / branch-andbound algorithm / feasible solution / shortest path algorithm / directional search / obvious solution / branch-and-cut algorithm / branch-and-bound algorithm / search direction / Branch-and-cut algorithms / purpose algorithm / / OperatingSystem Linux / / Organization Artificial Intelligence / Subbarao Kambhampati∗ Department of Computer Science Arizona State University Tempe AZ / National Science Foundation / United Nations / Arizona State University University / University of Colorado / Department of Industrial Engineering Leeds School / Institut f¨ / Computational Intelligence / / Person Vidal / V / Thomas Vossen / Van den Briel / / / Position satisfiability-based planner / Downward planner / translator / wb / planner / salesman / LCGP planner / / Product Koss KSC 10 Headphone/Headset / / ProvinceOrState a / Colorado / / Technology t -1 / purpose algorithm / artificial intelligence / Linux / shortest path algorithm / Branch-and-cut algorithms / planning algorithm / branchand-bound algorithms / branch-and-cut algorithm / LP-based branch-and-bound algorithm / branch-andbound algorithm / / SocialTag 
Reviving Integer Programming Approaches for AI Planning: A Branch-and-Cut Framework Menkes van den Briel Thomas Vossen