John N. Hooker

Orcid: 0000-0003-3169-1871

Affiliations:
  • Carnegie Mellon University, Pittsburgh, USA


According to our database1, John N. Hooker authored at least 121 papers between 1986 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
A guide to formulating fairness in an optimization model.
Ann. Oper. Res., July, 2023

Achieving consistency with cutting planes.
Math. Program., March, 2023

2022
Stochastic Planning and Scheduling with Logic-Based Benders Decomposition.
INFORMS J. Comput., 2022

Combining leximax fairness and efficiency in a mathematical programming model.
Eur. J. Oper. Res., 2022

Stochastic Binary Decision Diagrams.
Proceedings of the International Symposium on Artificial Intelligence and Mathematics 2022 (ISAIM 2022), 2022

Stochastic Decision Diagrams.
Proceedings of the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 2022

2021
Taking Principles Seriously: A Hybrid Approach to Value Alignment in Artificial Intelligence.
J. Artif. Intell. Res., 2021

When is it permissible for artificial intelligence to lie? A trust-based approach.
CoRR, 2021

Fairness through Optimization.
CoRR, 2021

2020
Compact representation of near-optimal integer programming solutions.
Math. Program., 2020

Optimization Bounds from the Branching Dual.
INFORMS J. Comput., 2020

Taking Principles Seriously: A Hybrid Approach to Value Alignment.
CoRR, 2020

Balancing Fairness and Efficiency in an Optimization Model.
CoRR, 2020

A Just Approach Balancing Rawlsian Leximax Fairness and Utilitarianism.
Proceedings of the AIES '20: AAAI/ACM Conference on AI, 2020

2019
A Logic-Based Benders Approach to Home Healthcare Delivery.
Transp. Sci., 2019

Optimization Bounds from the Branching Dual.
CoRR, 2019

Grounding Value Alignment with Ethical Principles.
CoRR, 2019

Truly Autonomous Machines Are Ethical.
AI Mag., 2019

Last-Mile Scheduling Under Uncertainty.
Proceedings of the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 2019

Consistency for 0-1 Programming.
Proceedings of the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 2019

Improved Job Sequencing Bounds from Decision Diagrams.
Proceedings of the Principles and Practice of Constraint Programming, 2019

A Multi-Label A* Algorithm for Multi-Agent Pathfinding.
Proceedings of the Twenty-Ninth International Conference on Automated Planning and Scheduling, 2019

2018
Truly Autonomous Machines Are Ethical.
CoRR, 2018

Mimetic vs Anchored Value Alignment in Artificial Intelligence.
CoRR, 2018

Constraint programming and operations research.
Constraints An Int. J., 2018

Dynamic Programming Bounds from Decision Diagrams.
Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2018

The Integrated Last-Mile Transportation Problem (ILMTP).
Proceedings of the Twenty-Eighth International Conference on Automated Planning and Scheduling, 2018

Toward Non-Intuition-Based Machine and Artificial Intelligence Ethics: A Deontological Approach Based on Modal Logic.
Proceedings of the 2018 AAAI/ACM Conference on AI, Ethics, and Society, 2018

2017
Job Sequencing Bounds from Decision Diagrams.
Proceedings of the Principles and Practice of Constraint Programming, 2017

2016
Decision Diagrams for Optimization
Artificial Intelligence: Foundations, Theory, and Algorithms, Springer, ISBN: 978-3-319-42849-9, 2016

Logic-based Benders decomposition for planning and scheduling: a computational analysis.
Knowl. Eng. Rev., 2016

Modeling with Metaconstraints and Semantic Typing of Variables.
INFORMS J. Comput., 2016

Discrete Optimization with Decision Diagrams.
INFORMS J. Comput., 2016

Integer programming as projection.
Discret. Optim., 2016

Projection, consistency, and George Boole.
Constraints An Int. J., 2016

Logic-Based Benders Decomposition for Multiagent Scheduling with Sequence-dependent Costs.
Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2016

Projection, Inference, and Consistency.
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

Scheduling Home Hospice Care with Logic-Based Benders Decomposition.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming, 2016

Finding Alternative Musical Scales.
Proceedings of the Principles and Practice of Constraint Programming, 2016

2015
Toward unification of exact and heuristic optimization methods.
Int. Trans. Oper. Res., 2015

2014
Optimization Bounds from Binary Decision Diagrams.
INFORMS J. Comput., 2014

Scheduling multiple factory cranes on a common track.
Comput. Oper. Res., 2014

Graph coloring inequalities from all-different systems.
Constraints An Int. J., 2014

Scope for industrial applications of production scheduling models and solution methods.
Comput. Chem. Eng., 2014

Robust Scheduling with Logic-Based Benders Decomposition.
Proceedings of the Operations Research Proceedings 2014, 2014

The Separation Problem for Binary Decision Diagrams.
Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2014

Optimization Bounds from Binary Decision Diagrams - (Extended Abstract).
Proceedings of the Principles and Practice of Constraint Programming, 2014

2013
Single-facility scheduling by logic-based Benders decomposition.
Ann. Oper. Res., 2013

Decision Diagrams and Dynamic Programming.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2013

Mixed Integer Programming vs. Logic-Based Benders Decomposition for Planning and Scheduling.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2013

2012
Combining Equity and Utilitarianism in a Mathematical Programming Model.
Manag. Sci., 2012

Graph Coloring Facets from All-Different Systems.
Proceedings of the Integration of AI and OR Techniques in Contraint Programming for Combinatorial Optimzation Problems, 2012

Variable Ordering for the Application of BDDs to the Maximum Independent Set Problem.
Proceedings of the Integration of AI and OR Techniques in Contraint Programming for Combinatorial Optimzation Problems, 2012

2011
Manipulating MDD Relaxations for Combinatorial Optimization.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2011

2010
Optimality conditions for distributive justice.
Int. Trans. Oper. Res., 2010

An Integrated Solver for Optimization Problems.
Oper. Res., 2010

Single-Facility Scheduling over Long Time Horizons by Logic-Based Benders Decomposition.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2010

A Systematic Approach to MDD-Based Constraint Programming.
Proceedings of the Principles and Practice of Constraint Programming - CP 2010, 2010

Optimization Methods in Logic.
Proceedings of the Boolean Models and Methods in Mathematics, 2010

2009
Integer Programming Duality.
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Integer Programming: Lagrangian Relaxation.
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

2008
Solving the Capacitated Local Access Network Design Problem.
INFORMS J. Comput., 2008

Propagating Separable Equalities in an MDD Store.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2008

Approximate Compilation of Constraints into Multivalued Decision Diagrams.
Proceedings of the Principles and Practice of Constraint Programming, 2008

2007
Planning and Scheduling by Logic-Based Benders Decomposition.
Oper. Res., 2007

A Framework for Integrating Optimization and Constraint Programming.
Proceedings of the Abstraction, 2007

Cost-Bounded Binary Decision Diagrams for 0-1 Programming.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2007

A Constraint Store Based on Multivalued Decision Diagrams.
Proceedings of the Principles and Practice of Constraint Programming, 2007

Integrated methods for optimization.
International series in operations research and management science 100, Springer, ISBN: 978-0-387-38272-2, 2007

2006
Operations Research Methods in Constraint Programming.
Proceedings of the Handbook of Constraint Programming, 2006

An Integrated Method for Planning and Scheduling to Minimize Tardiness.
Constraints An Int. J., 2006

Duality in Optimization and Constraint Satisfaction.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2006

A Filter for the Circuit Constraint.
Proceedings of the Principles and Practice of Constraint Programming, 2006

2005
A Hybrid Method for the Planning and Scheduling.
Constraints An Int. J., 2005

A Search-Infer-and-Relax Framework for Integrating Solution Methods.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2005

Domain Reduction for the Circuit Constraint.
Proceedings of the Principles and Practice of Constraint Programming, 2005

Planning and Scheduling to Minimize Tardiness.
Proceedings of the Principles and Practice of Constraint Programming, 2005

2004
SIMPL: A System for Integrating Optimization Techniques.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2004

2003
Convex Programming Methods for Global Optimization.
Proceedings of the Global Optimization and Constraint Satisfaction, 2003

2002
Partial Instantiation Methods for Inference in First-Order Logic.
J. Autom. Reason., 2002

Logic, Optimization, and Constraint Programming.
INFORMS J. Comput., 2002

Abstracts of Invited Talks.
Proceedings of the Theory and Practice of Timed Systems, 2002

Solving Fixed-Charge Network Flow Problems with a Hybrid Optimization and Constraint Programming Approach.
Ann. Oper. Res., 2002

A Relaxation of the Cumulative Constraint.
Proceedings of the Principles and Practice of Constraint Programming, 2002

2001
Optimal Design of Truss Structures by Logic-Based Branch and Cut.
Oper. Res., 2001

A Declarative Modeling Framework that Integrates Solution Methods.
Ann. Oper. Res., 2001

2000
Inference-Based Sensitivity Analysis for Mixed Integer/Linear Programming.
Oper. Res., 2000

Mixed Global Constraints and Inference in Hybrid CLP-IP Solvers.
Electron. Notes Discret. Math., 2000

1999
Tight representation of logical constraints as cardinality rules.
Math. Program., 1999

Mixed Logical-linear Programming.
Discret. Appl. Math., 1999

Inference Duality as a Basis for Sensitivity Analysis.
Constraints An Int. J., 1999

On Integrating Constraint Propagation and Linear Programming for Combinatorial Optimization.
Proceedings of the Sixteenth National Conference on Artificial Intelligence and Eleventh Conference on Innovative Applications of Artificial Intelligence, 1999

1996
Resolution and the integrality of satisfiability problems.
Math. Program., 1996

A linear programming framework for logics of uncertainty.
Decis. Support Syst., 1996

Determining lower and upper bounds on probabilities of atomic propositions in sets of logical formulas represented by digraphs.
Ann. Oper. Res., 1996

Inference Duality as a Basis for Secitivity Analysis.
Proceedings of the Second International Conference on Principles and Practice of Constraint Programming, 1996

1995
Solving a General Routing and Scheduling Problem by Chain Decomposition and Tabu Search.
Transp. Sci., 1995

Branching Rules for Satisfiability.
J. Autom. Reason., 1995

Testing heuristics: We have it all wrong.
J. Heuristics, 1995

Boolean regression.
Ann. Oper. Res., 1995

1994
Predicting Cause-Effect Relationships from Incomplete Discrete Observations.
SIAM J. Discret. Math., 1994

Needed: An Empirical Science of Algorithms.
Oper. Res., 1994

A Computational Study of Satisfiability Algorithms for Propositional Logic.
INFORMS J. Comput., 1994

Bayesian logic.
Decis. Support Syst., 1994

Logic cuts for processing networks with fixed charges.
Comput. Oper. Res., 1994

Logic-Based Methods for Optimization.
Proceedings of the Principles and Practice of Constraint Programming, 1994

Branching Rules for Satisfiability (Extended Abstract).
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1994

1993
Solving the incremental satisfiability problem.
J. Log. Program., 1993

New methods for computing inferences in first order logic.
Ann. Oper. Res., 1993

1992
Detecting Embedded Horn Structure in Propositional Logic.
Inf. Process. Lett., 1992

Generalized Resolution for 0-1 Linear Inequalities.
Ann. Math. Artif. Intell., 1992

1991
Extended Horn Sets In Propositional Logic.
J. ACM, 1991

Finite Dominating Sets for Network Location Problems.
Oper. Res., 1991

Logical Inference and Polyhedral Projection.
Proceedings of the Computer Science Logic, 5th Workshop, 1991

1990
Branch-and-Cut Solution of Inference Problems in Propositional Logic.
Ann. Math. Artif. Intell., 1990

1989
On the Vector Assignment <i>p</i>-Median Problem.
Transp. Sci., 1989

Solving nonlinear multiple-facility network location problems.
Networks, 1989

Input Proofs and Rank One Cutting Planes.
INFORMS J. Comput., 1989

1988
A quantitative approach to logical inference.
Decis. Support Syst., 1988

Networklike metric spaces.
Discret. Math., 1988

1986
Solving Nonlinear Single-Facility Network Location Problems.
Oper. Res., 1986


  Loading...