John N. Hooker

From MaRDI portal
Person:662263

Available identifiers

zbMath Open hooker.john-n-junMaRDI QIDQ662263

List of research outcomes

PublicationDate of PublicationType
A guide to formulating fairness in an optimization model2023-07-31Paper
Achieving consistency with cutting planes2023-03-01Paper
Stochastic decision diagrams2022-08-30Paper
Combining leximax fairness and efficiency in a mathematical programming model2022-02-23Paper
Optimization Bounds from the Branching Dual2020-12-11Paper
Logic-Based Benders Decomposition for Large-Scale Optimization2020-07-07Paper
Compact representation of near-optimal integer programming solutions2020-06-26Paper
A Brief Tour of Logic and Optimization2019-10-30Paper
Consistency for \(0-1\) programming2019-10-14Paper
The Hamiltonian Circuit Polytope2018-12-05Paper
Constraint programming and operations research2018-11-06Paper
Seamless Multimodal Transportation Scheduling2018-07-25Paper
Integer programming as projection2018-05-24Paper
Scheduling multiple factory cranes on a common track2016-11-10Paper
Scheduling Home Hospice Care with Logic-Based Benders Decomposition2016-06-27Paper
Modeling with Metaconstraints and Semantic Typing of Variables2016-05-19Paper
Robust Scheduling with Logic-Based Benders Decomposition2016-05-19Paper
Projection, consistency, and George Boole2016-04-12Paper
Toward unification of exact and heuristic optimization methods2015-04-22Paper
Single-facility scheduling by logic-based Benders decomposition2014-03-31Paper
Decision Diagrams and Dynamic Programming2013-06-04Paper
Mixed Integer Programming vs. Logic-Based Benders Decomposition for Planning and Scheduling2013-06-04Paper
Solving the Capacitated Local Access Network Design Problem2012-07-28Paper
Logic, Optimization, and Constraint Programming2012-05-30Paper
Integrated methods for optimization2012-02-22Paper
An Integrated Solver for Optimization Problems2011-11-24Paper
Optimality conditions for distributive justice2011-05-23Paper
Hybrid Modeling2010-12-22Paper
Single-Facility Scheduling over Long Time Horizons by Logic-Based Benders Decomposition2010-06-22Paper
Planning and Scheduling by Logic-Based Benders Decomposition2009-08-13Paper
Optimal Design of Truss Structures by Logic-Based Branch and Cut2009-07-03Paper
Cost-Bounded Binary Decision Diagrams for 0-1 Programming2009-03-10Paper
Planning and Scheduling to Minimize Tardiness2008-09-09Paper
Principles and Practice of Constraint Programming – CP 20042008-09-09Paper
A Search-Infer-and-Relax Framework for Integrating Solution Methods2008-03-17Paper
Convex Programming Methods for Global Optimization2008-03-14Paper
Constraint Programming2007-06-19Paper
Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems2007-04-30Paper
Integrated methods for optimization.2007-01-03Paper
A hybrid method for the planning and scheduling2006-11-03Paper
An integrated method for planning and scheduling to minimize tardiness2006-11-03Paper
https://portal.mardi4nfdi.de/entity/Q54942122006-10-17Paper
Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems2005-12-27Paper
https://portal.mardi4nfdi.de/entity/Q46685402005-04-19Paper
https://portal.mardi4nfdi.de/entity/Q44705242004-07-01Paper
Logic-based Benders decomposition2003-07-13Paper
Solving fixed-charge network flow problems with a hybrid optimization and constraint programming approach2003-01-27Paper
Mixed global constraints and inference in hybrid CLP--IP solvers2002-06-27Paper
Inference-Based Sensitivity Analysis for Mixed Integer/Linear Programming2002-06-04Paper
A declarative modeling framework that integrates solution methods2002-03-26Paper
https://portal.mardi4nfdi.de/entity/Q27413852001-09-24Paper
Tight representation of logical constraints as cardinality rules2001-02-09Paper
Inference duality as a basis for sensitivity analysis1999-09-07Paper
https://portal.mardi4nfdi.de/entity/Q43770391998-02-08Paper
Branch-and-cut solution of inference problems in propositional logic1997-12-14Paper
Resolution and the integrality of satisfiability problems1997-08-18Paper
Generalized resolution for 0--1 linear inequalities1997-05-13Paper
Determining lower and upper bounds on probabilities of atomic propositions in sets of logical formulas represented by digraphs1996-11-19Paper
Testing heuristics: We have it all wrong1996-09-01Paper
Boolean regression1996-05-02Paper
Branching rules for satisfiability1995-12-20Paper
Solving a General Routing and Scheduling Problem by Chain Decomposition and Tabu Search1995-11-23Paper
A Computational Study of Satisfiability Algorithms for Propositional Logic1995-01-11Paper
Predicting Cause-Effect Relationships from Incomplete Discrete Observations1994-12-20Paper
Needed: An Empirical Science of Algorithms1994-09-20Paper
Logic cuts for processing networks with fixed charges1994-03-24Paper
New methods for computing inferences in first order logic1993-12-20Paper
https://portal.mardi4nfdi.de/entity/Q42029421993-09-06Paper
Solving the incremental satisfiability problem1993-05-16Paper
Input Proofs and Rank One Cutting Planes1993-01-16Paper
On the Vector Assignment p-Median Problem1989-01-01Paper
Solving nonlinear multiple-facility network location problems1989-01-01Paper
Networklike metric spaces1988-01-01Paper
Resolution vs. cutting plane solution of inference problems: Some computational experience1988-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: John N. Hooker