Editorial Board.
- Published in:
- INFORMS Journal on Computing, 2021, v. 33, n. 3, p. C2, doi. 10.1287/ijoc.2021.eb.v3303
- Publication type:
- Article
Works in INFORMS Journal on Computing, 2021, Vol 33, Issue 3
Results: 26
1
2
Note from the Editor.
- Published in:
- INFORMS Journal on Computing, 2021, v. 33, n. 3, p. 837, doi. 10.1287/ijoc.2021.1102
- By:
- Publication type:
- Article
3
3-D Dynamic UAV Base Station Location Problem.
- Published in:
- INFORMS Journal on Computing, 2021, v. 33, n. 3, p. 839, doi. 10.1287/ijoc.2020.1034
- By:
- Publication type:
- Article
4
Combinatorial Benders Decomposition for the Two-Dimensional Bin Packing Problem.
- Published in:
- INFORMS Journal on Computing, 2021, v. 33, n. 3, p. 963, doi. 10.1287/ijoc.2020.1014
- By:
- Publication type:
- Article
5
Modeling and Solving the Intersection Inspection Rural Postman Problem.
- Published in:
- INFORMS Journal on Computing, 2021, v. 33, n. 3, p. 1245, doi. 10.1287/ijoc.2020.1013
- By:
- Publication type:
- Article
6
Tagging Items Automatically Based on Both Content Information and Browsing Behaviors.
- Published in:
- INFORMS Journal on Computing, 2021, v. 33, n. 3, p. 882, doi. 10.1287/ijoc.2020.1007
- By:
- Publication type:
- Article
7
A New Combinatorial Algorithm for Separable Convex Resource Allocation with Nested Bound Constraints.
- Published in:
- INFORMS Journal on Computing, 2021, v. 33, n. 3, p. 1197, doi. 10.1287/ijoc.2020.1006
- By:
- Publication type:
- Article
8
Knowledge Learning of Insurance Risks Using Dependence Models.
- Published in:
- INFORMS Journal on Computing, 2021, v. 33, n. 3, p. 1177, doi. 10.1287/ijoc.2020.1005
- By:
- Publication type:
- Article
9
The Rank-One Quadratic Assignment Problem.
- Published in:
- INFORMS Journal on Computing, 2021, v. 33, n. 3, p. 979, doi. 10.1287/ijoc.2020.1003
- By:
- Publication type:
- Article
10
Data-Driven Optimization of Reward-Risk Ratio Measures.
- Published in:
- INFORMS Journal on Computing, 2021, v. 33, n. 3, p. 1120, doi. 10.1287/ijoc.2020.1002
- By:
- Publication type:
- Article
11
An Augmented Lagrangian Decomposition Method for Chance-Constrained Optimization Problems.
- Published in:
- INFORMS Journal on Computing, 2021, v. 33, n. 3, p. 1056, doi. 10.1287/ijoc.2020.1001
- By:
- Publication type:
- Article
12
A Branch-and-Bound Algorithm for Team Formation on Social Networks.
- Published in:
- INFORMS Journal on Computing, 2021, v. 33, n. 3, p. 1162, doi. 10.1287/ijoc.2020.1000
- By:
- Publication type:
- Article
13
An Exact Algorithm for Large-Scale Continuous Nonlinear Resource Allocation Problems with Minimax Regret Objectives.
- Published in:
- INFORMS Journal on Computing, 2021, v. 33, n. 3, p. 1213, doi. 10.1287/ijoc.2020.0999
- By:
- Publication type:
- Article
14
Multicomponent Maintenance Optimization: A Stochastic Programming Approach.
- Published in:
- INFORMS Journal on Computing, 2021, v. 33, n. 3, p. 898, doi. 10.1287/ijoc.2020.0997
- By:
- Publication type:
- Article
15
Multiproduct Newsvendor Problem with Customer-Driven Demand Substitution: A Stochastic Integer Program Perspective.
- Published in:
- INFORMS Journal on Computing, 2021, v. 33, n. 3, p. 1229, doi. 10.1287/ijoc.2020.0996
- By:
- Publication type:
- Article
16
Extreme Ray Feasibility Cuts for Unit Commitment with Uncertainty.
- Published in:
- INFORMS Journal on Computing, 2021, v. 33, n. 3, p. 1037, doi. 10.1287/ijoc.2020.0995
- By:
- Publication type:
- Article
17
Mixed-Integer Convex Nonlinear Optimization with Gradient-Boosted Trees Embedded.
- Published in:
- INFORMS Journal on Computing, 2021, v. 33, n. 3, p. 1103, doi. 10.1287/ijoc.2020.0993
- By:
- Publication type:
- Article
18
An Improved Branch-and-Bound Algorithm for the One-Machine Scheduling Problem with Delayed Precedence Constraints.
- Published in:
- INFORMS Journal on Computing, 2021, v. 33, n. 3, p. 1091, doi. 10.1287/ijoc.2020.0988
- By:
- Publication type:
- Article
19
Robust Models for the Kidney Exchange Problem.
- Published in:
- INFORMS Journal on Computing, 2021, v. 33, n. 3, p. 861, doi. 10.1287/ijoc.2020.0986
- By:
- Publication type:
- Article
20
Time-Dependent Shortest Path Problems with Penalties and Limits on Waiting.
- Published in:
- INFORMS Journal on Computing, 2021, v. 33, n. 3, p. 997, doi. 10.1287/ijoc.2020.0985
- By:
- Publication type:
- Article
21
A Branch-and-Price Framework for Decomposing Graphs into Relaxed Cliques.
- Published in:
- INFORMS Journal on Computing, 2021, v. 33, n. 3, p. 1070, doi. 10.1287/ijoc.2020.0984
- By:
- Publication type:
- Article
22
The Quadratic Multiknapsack Problem with Conflicts and Balance Constraints.
- Published in:
- INFORMS Journal on Computing, 2021, v. 33, n. 3, p. 949, doi. 10.1287/ijoc.2020.0983
- By:
- Publication type:
- Article
23
A Framework for Solving Chance-Constrained Linear Matrix Inequality Programs.
- Published in:
- INFORMS Journal on Computing, 2021, v. 33, n. 3, p. 1015, doi. 10.1287/ijoc.2020.0982
- By:
- Publication type:
- Article
24
The Risk-Averse Static Stochastic Knapsack Problem.
- Published in:
- INFORMS Journal on Computing, 2021, v. 33, n. 3, p. 931, doi. 10.1287/ijoc.2020.0972
- By:
- Publication type:
- Article
25
Rapid Discrete Optimization via Simulation with Gaussian Markov Random Fields.
- Published in:
- INFORMS Journal on Computing, 2021, v. 33, n. 3, p. 915, doi. 10.1287/ijoc.2020.0971
- By:
- Publication type:
- Article
26
Linearized Robust Counterparts of Two-Stage Robust Optimization Problems with Applications in Operations Management.
- Published in:
- INFORMS Journal on Computing, 2021, v. 33, n. 3, p. 1138, doi. 10.1287/ijoc.2020.0959
- By:
- Publication type:
- Article