INFORMS Journal on Computing

Quicklinks & Resources

Recent Content

RouteOpt: An Open-Source Modular Exact Solver for Vehicle Routing Problems
- Zhengzhong You
  Zhengzhong You
  [email protected]
  https://orcid.org/0009-0007-3480-5578
  Department of Industrial and Systems Engineering, University of Florida, Gainesville, Florida 32611; and Center for Applied Optimization, University of Florida, Gainesville, Florida 32611
  Search for more papers by this author
  ,
- Yu Yang
  Corresponding Author
  Yu Yang
  [email protected]
  https://orcid.org/0000-0002-0502-7603
  Department of Industrial and Systems Engineering, University of Florida, Gainesville, Florida 32611; and Center for Applied Optimization, University of Florida, Gainesville, Florida 32611
  Search for more papers by this author
Published Online:May 21, 2026
Preview Abstract
Abstract
Despite significant advancements in exact methods for vehicle routing problems (VRPs) over the past three decades, there remains a lack of high-performing and accessible open-source solvers for researchers and practitioners. To bridge this gap, we ...
Towards Large-Scale Probabilistic Set Covering Problems: An Efficient Benders Decomposition Approach
- Wei Lv
  Wei Lv
  [email protected]
  https://orcid.org/0009-0009-6861-9532
  School of Mathematics and Computational Science, Xiangtan University, Xiangtan 411105, China; and School of Mathematics and Statistics, Beijing Institute of Technology, Beijing 100811, China
  Search for more papers by this author
  ,
- Wei-Kun Chen
  Corresponding Author
  Wei-Kun Chen
  [email protected]
  https://orcid.org/0000-0003-4147-1346
  School of Mathematics and Statistics, Beijing Institute of Technology, Beijing 100811, China
  Search for more papers by this author
  ,
- Yi-Long Chen
  Yi-Long Chen
  [email protected]
  School of Mathematics and Statistics, Beijing Institute of Technology, Beijing 100811, China
  Search for more papers by this author
  ,
- Yu-Hong Dai
  Yu-Hong Dai
  [email protected]
  https://orcid.org/0000-0002-6932-9512
  State Key Laboratory of Mathematical Sciences, Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing 100045, China; and School of Mathematical Sciences, University of Chinese Academy of Sciences, Beijing 101408, China
  Search for more papers by this author
Published Online:May 20, 2026
Preview Abstract
Abstract
In this paper, we investigate the probabilistic set covering problem (PSCP) in which the right-hand side is a binary random vector and the covering constraint is required to be satisfied with a prespecified probability. We consider the case with a finite ...
Learn to Formulate: A Surrogate Model Framework for Generalized Assignment Problem with Routing Constraints
- Sen Xue
  Sen Xue
  [email protected]
  https://orcid.org/0000-0001-7323-560X
  School of Mathematical Sciences, Zhejiang University, Hangzhou 310058, China
  Search for more papers by this author
  ,
- Chuanhou Gao
  Corresponding Author
  Chuanhou Gao
  [email protected]
  https://orcid.org/0000-0001-9030-2042
  School of Mathematical Sciences, and Center for Interdisciplinary Applied Mathematics, Zhejiang University, Hangzhou 310058, China
  Search for more papers by this author
Published Online:May 19, 2026
Preview Abstract
Abstract
The generalized assignment problem with routing constraints, for example, the vehicle routing problem, has essential practical relevance. This paper focuses on addressing the complexities of the problem by learning a surrogate model with reduced variables ...
Rank-Constrained Mixed-Integer Optimization for Heterogeneous Sensor Location in Route Reconstruction
- Chenyi Fu
  Chenyi Fu
  [email protected]
  https://orcid.org/0009-0000-5300-5188
  School of Management, Northwestern Polytechnical University, Xi’an 710129, China
  Search for more papers by this author
  ,
- Li Chen
  Corresponding Author
  Li Chen
  [email protected]
  https://orcid.org/0000-0002-5370-8518
  Discipline of Business Analytics, The University of Sydney, Camperdown, New South Wales 2006, Australia
  Search for more papers by this author
  ,
- Zhiyuan Lou
  Corresponding Author
  Zhiyuan Lou
  [email protected]
  https://orcid.org/0009-0004-4787-0975
  School of Management, Technical University of Munich, 74076 Heilbronn, Germany
  Search for more papers by this author
Published Online:May 18, 2026
Preview Abstract
Abstract
In this paper, we introduce a mixed-integer rank-constrained optimization model for the route reconstruction–oriented heterogeneous sensor location problem. Although rank constraints are generally nonconvex and not mixed-integer convex representable, we ...
A Branch-Price-and-Cut Algorithm for the Multicommodity Two-Echelon Vehicle Routing Problem with Time Windows
- Tayeb Mhamedi
  Tayeb Mhamedi
  [email protected]
  https://orcid.org/0000-0002-3354-6398
  Department of Mathematics and Industrial Engineering, Polytechnique Montréal, Montréal, Québec H3T 1J4, Canada; and Group for Research in Decision Analysis (GERAD), HEC Montréal, Montréal, Québec H3T 2A7, Canada
  Search for more papers by this author
  ,
- Marilène Cherkesly
  Marilène Cherkesly
  [email protected]
  https://orcid.org/0000-0003-0912-1178
  Department of Management and Technology, Université du Québec à Montréal, Montréal, Québec H2X 3X2, Canada; and Group for Research in Decision Analysis (GERAD), HEC Montréal, Montréal, Québec H3T 2A7, Canada
  Search for more papers by this author
  ,
- Guy Desaulniers
  Corresponding Author
  Guy Desaulniers
  [email protected]
  https://orcid.org/0000-0003-4469-9813
  Department of Mathematics and Industrial Engineering, Polytechnique Montréal, Montréal, Québec H3T 1J4, Canada; and Group for Research in Decision Analysis (GERAD), HEC Montréal, Montréal, Québec H3T 2A7, Canada
  Search for more papers by this author
Published Online:May 15, 2026
Preview Abstract
Abstract
In the multicommodity two-echelon vehicle routing problem with time windows (MC-2E-VRPTW), first-echelon vehicles transport goods from depots to satellites, whereas second-echelon vehicles ensure that goods are shipped from satellites to customers within ...

EDITOR-IN-CHIEF

Andrea Lodi

Frequency: Bimonthly

ISSN: 1091-9856 (Print)

ISSN: 1526-5528 (Online)

2024 Impact Factor: 2.1

5-year Impact Factor: 2.7

Featured Article

Antonio M. Sudoso

Featured Article

Rosario Paradiso, Angelos Georghiou, S. Dabia, Denise Tönissen

Featured Article

Swati Gupta, Cyrus Hettle, Daniel Molzahn

Featured Article

Prachi Shah, Santanu S. Dey, Marco Molinaro

Meritorious Paper

John Gunnar Carlsson, Julien Yu

Available Issues

Available Issues

Recent Content

Abstract

Abstract

Abstract

Abstract

Abstract

EDITOR-IN-CHIEF

Quicklinks & Resources

Announcements

New Issue — March-April

IJOC Length Policy

Featured Jobs