Jean-Paul Watson

Orcid: 0000-0001-6026-8875

According to our database1, Jean-Paul Watson authored at least 55 papers between 1998 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
A parallel hub-and-spoke system for large-scale scenario-based optimization under uncertainty.
Math. Program. Comput., December, 2023

Best Response Intersection: An Optimal Algorithm for Interdiction Defense.
INFORMS J. Optim., April, 2023

2022
A computationally efficient algorithm for computing convex hull prices.
Comput. Ind. Eng., 2022

DRAGON: Deep Reinforcement Learning for Autonomous Grid Operation and Attack Detection.
Proceedings of the Annual Computer Security Applications Conference, 2022

2020
A novel matching formulation for startup costs in unit commitment.
Math. Program. Comput., 2020

Optimization-Driven Scenario Grouping.
INFORMS J. Comput., 2020

On Mixed-Integer Programming Formulations for the Unit Commitment Problem.
INFORMS J. Comput., 2020

Modeling flexible generator operating regions via chance-constrained stochastic unit commitment.
Comput. Manag. Sci., 2020

2019
Approximating two-stage chance-constrained programs with classical probability bounds.
Optim. Lett., 2019

Mixed-integer programming models for optimal constellation scheduling given cloud cover uncertainty.
Eur. J. Oper. Res., 2019

2018
Distributionally Robust Optimization with Principal Component Analysis.
SIAM J. Optim., 2018

pyomo.dae: a modeling and automatic discretization framework for optimization with differential and algebraic equations.
Math. Program. Comput., 2018

Chance-constrained economic dispatch with renewable energy and storage.
Comput. Optim. Appl., 2018

A multitree approach for global solution of ACOPF problems using piecewise outer approximations.
Comput. Chem. Eng., 2018

2017
BBPH: Using progressive hedging within branch and bound to solve multi-stage stochastic mixed integer programs.
Oper. Res. Lett., 2017

Contingency-constrained unit commitment with post-contingency corrective recourse.
Ann. Oper. Res., 2017

2016
Cutting planes for the multistage stochastic unit commitment problem.
Math. Program., 2016

Obtaining lower bounds from the progressive hedging algorithm for stochastic mixed-integer programs.
Math. Program., 2016

New bounding and decomposition approaches for MILP investment problems: Multi-area transmission and generation planning under policy constraints.
Eur. J. Oper. Res., 2016

A Comparison of Policies on the Participation of Storage in U.S. Frequency Regulation Markets.
CoRR, 2016

2015
Integration of progressive hedging and dual decomposition in stochastic integer programs.
Oper. Res. Lett., 2015

Efficient Representation of Uncertainty for Stochastic Economic Dispatch.
CoRR, 2015

A scalable solution framework for stochastic transmission and generation planning problems.
Comput. Manag. Sci., 2015

Stochastic optimization models in forest planning: a progressive hedging solution approach.
Ann. Oper. Res., 2015

2014
Integrating Energy Storage Devices Into Market Management Systems.
Proc. IEEE, 2014

Toward Using Surrogates to Accelerate Solution of Stochastic Electricity Grid Operations Problems.
CoRR, 2014

2013
Guest Editorial: Introduction to the special section on optimization methods and algorithms applied to smart grid.
IEEE Trans. Smart Grid, 2013

Block-oriented modeling of superstructure optimization problems.
Comput. Chem. Eng., 2013

2012
PySP: modeling and solving stochastic programs in Python.
Math. Program. Comput., 2012

A stochastic programming approach for gas detector placement using CFD-based dispersion simulations.
Comput. Chem. Eng., 2012

Solving the Connected Dominating Set Problem and Power Dominating Set Problem by Integer Programming.
Proceedings of the Combinatorial Optimization and Applications, 2012

2011
Pyomo: modeling and solving mathematical programs in Python.
Math. Program. Comput., 2011

Combining Constraint Programming and Local Search for Job-Shop Scheduling.
INFORMS J. Comput., 2011

Non-manifold surface reconstruction from high-dimensional point cloud data.
Comput. Geom., 2011

Progressive hedging innovations for a class of stochastic mixed-integer resource allocation problems.
Comput. Manag. Sci., 2011

2010
Scalable Heuristics for a Class of Chance-Constrained Stochastic Programs.
INFORMS J. Comput., 2010

2009
US Environmental Protection Agency Uses Operations Research to Reduce Contamination Risks in Drinking Water.
Interfaces, 2009

2008
Semantic-Enabled and Agent-based Environment Aware Agile Service Utilities.
Proceedings of the Fourth International Conference on Semantics, Knowledge and Grid, 2008

A Hybrid Constraint Programming / Local Search Approach to the Job-Shop Scheduling Problem.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2008

2007
Limited-Memory Techniques for Sensor Placement in Water Distribution Networks.
Proceedings of the Learning and Intelligent Optimization, Second International Conference, 2007

2006
Deconstructing Nowicki and Smutnicki's <i>i</i>-TSAB tabu search algorithm for the job-shop scheduling problem.
Comput. Oper. Res., 2006

2005
Linking Search Space Structure, Run-Time Dynamics, and Problem Difficulty: A Step Toward Demystifying Tabu Search.
J. Artif. Intell. Res., 2005

2004
Scheduling Space-Ground Communications for the Air Force Satellite Control Network.
J. Sched., 2004

Properties of Gray and Binary Representations.
Evol. Comput., 2004

Spares Optimization for the Lockheed Martin Joint Strike Fighter.
Proceedings of the 36th conference on Winter simulation, 2004

Landscape Regularity and Random Walks for the Job-Shop Scheduling Problem.
Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2004

2003
Problem difficulty for tabu search in job-shop scheduling.
Artif. Intell., 2003

Quad Search and Hybrid Genetic Algorithms.
Proceedings of the Genetic and Evolutionary Computation, 2003

2002
Contrasting Structured and Random Permutation Flow-Shop Scheduling Problems: Search-Space Topology and Algorithm Performance.
INFORMS J. Comput., 2002

Satellite Range Scheduling: A Comparison of Genetic, Heuristic and Local Search.
Proceedings of the Parallel Problem Solving from Nature, 2002

2000
Local Search and High Precision Gray Codes: Convergence Results and Neighborhoods.
Proceedings of the Sixth Workshop on Foundations of Genetic Algorithms, 2000

Dynamic Representations and Escaping Local Optima: Improving Genetic Algorithms and Local Search.
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on on Innovative Applications of Artificial Intelligence, July 30, 2000

1999
Algorithm Performance and Problem Structure for Flow-shop Scheduling.
Proceedings of the Sixteenth National Conference on Artificial Intelligence and Eleventh Conference on Innovative Applications of Artificial Intelligence, 1999

1998
Comparing heuristic search methods and genetic algorithms for warehouse scheduling.
Proceedings of the IEEE International Conference on Systems, Man and Cybernetics, 1998

The Traveling Salesrep Problem, Edge Assembly Crossover, and 2-opt.
Proceedings of the Parallel Problem Solving from Nature, 1998


  Loading...