-

 

 

 




Optimization Online





 

Optimization Online Digest — March 2021

Applications — OR and Management Sciences

A tailored Benders decomposition approach for last-mile delivery with autonomous robots
Laurent Alfandari, Ivana Ljubic, Marcos de Melo da Silva

A Planner-Trader Decomposition for Multi-Market Hydro Scheduling
Kilian Schindler, Napat Rujeerapaiboon, Daniel Kuhn, Wolfram Wiesemann

Application-Driven Learning via Joint Prediction and Optimization of Demand and Reserves Requirement
Joaquim Dias Garcia, Alexandre Street, Tito Homem-de-Mello, Francisco D. Muñoz

A Computational Study of Constraint Programming Approaches for Resource-Constrained Project Scheduling with Autonomous Learning Effects
Alessandro Hill, Jordan Ticktin, Thomas Vossen

Robust Planning of Sorting Operations in Express Delivery Systems
Reem Khir, Alan Erera, Alejandro Toriello

Robust Price Optimization of Multiple Products under Interval Uncertainties
Mahdi Hamzeei, Alvin Lim, Jiefeng Xu

Marketing Mix Optimization with Practical Constraints
Hsin-Chan Huang, Jiefeng Xu, Alvin Lim

Robust Vehicle Routing under Uncertainty via Branch-Price-and-Cut
Akang Wang, Anirudh Subramanyam, Chrysanthos E. Gounaris

Robust Portfolio Selection Problems: A Comprehensive Review
Alireza Ghahtarani, Ahmed Saif, Alireza Ghasemi

Long-run market equilibria in coupled energy sectors: A study of uniqueness
Jonas Egerer, Veronika Grimm, Julia Grübel, Gregor Zöttl

Assortment Optimization under the Decision Forest Model
Yi-Chun Chen, Velibor Mišić

Decomposition strategies for vehicle routing heuristics
Alberto Santini, Michael Schneider, Thibaut Vidal, Daniele Vigo

Optimizing Driver Menus Under Stochastic Selection Behavior for Ridesharing and Crowdsourced Delivery
Hannah Horner, Jennifer Pazour, John E. Mitchell

Applications — Science and Engineering

Budget-Cut: Introduction to a budget based cutting-plane algorithm for capacity expansion models
Oliver Rehberg, Bismark Singh, Theresa Groß, Maximilian Hoffmann, Leander Kotzur, Detlef Stolten

Combinatorial Optimization

Sequential Competitive Facility Location: Exact and Approximate Algorithms
Mingyao Qi, Ruiwei Jiang, Siqian Shen

Finite convergence of sum-of-squares hierarchies for the stability number of a graph
Monique Laurent, Luis Felipe Vargas

Lower Bounds on the Size of General Branch-and-Bound Trees
Santanu S. Dey, Yatharth Dubey, Marco Molinaro

Characterizing Linearizable QAPs by the Level-1 Reformulation-Linearization Technique
Lucas Waddell, Warren Adams

Convex and Nonsmooth Optimization

String-Averaging Methods for Best Approximation to Common Fixed Point Sets of Operators: The Finite and Infinite Cases
Yair Censor, Ariel Nisenbaum

Universal Conditional Gradient Sliding for Convex Optimization
Yuyuan Ouyang, Trevor Squires

Minimizing Nonsmooth Convex Functions with Variable Accuracy
Nataša Krejić , Nataša Krklec Jerinkić, Tijana Ostojić

A Proximal Quasi-Newton Trust-Region Method for Nonsmooth Regularized Optimization
Aleksandr Y. Aravkin, Robert Baraldi, Dominique Orban

Integer Programming

An Approximation Algorithm for Indefinite Mixed Integer Quadratic Programming
Alberto Del Pia

Shapes and recession cones in mixed-integer convex representability
Ilias Zadik, Miles Lubin, Juan Pablo Vielma

Presolving Linear Bilevel Optimization Problems
Thomas Kleinert, Julian Manns, Martin Schmidt, Dieter Weninger

Strong valid inequalities for a class of concave submodular minimization problems under cardinality constraints
Simge Küçükyavuz, Qimeng Yu

A Computational Study of Perspective Cuts
Ksenia Bestuzheva, Ambros Gleixner, Stefan Vigerske

Linear, Cone and Semidefinite Programming

Infeasibility detection with primal-dual hybrid gradient for large-scale linear programming
David Applegate, Díaz Mateo, Haihao Lu, Miles Lubin

Network Optimization

Improving Column-Generation for Vehicle Routing Problems via Random Coloring and Parallelization
Miao Yu, Viswanath Nagarajan, Siqian Shen

Nonlinear Optimization

A Framework of Inertial Alternating Direction Method of Multipliers for Non-Convex Non-Smooth Optimization
Le Thi Khanh Hien, Duy Nhat Phan, Nicolas Gillis

A Penalty-free Infeasible Approach for a Class of Nonsmooth Optimization Problems over the Stiefel Manifold
Nachuan Xiao, Xin Liu, Ya-xiang Yuan

Active-set identification with complexity guarantees of an almost cyclic 2-coordinate descent method with Armijo line search
Andrea Cristofari

Use of static surrogates in hyperparameter optimization
Dounia Lakhmiri, Sébastien Le Digabel

Global convergence of Riemannian line search methods with a Zhang-Hager-type condition
Harry Oviedo

Further developments of methods for traversing regions of non-convexity in optimization problems
Michael Bartholomew-Biggs, Salah Beddiaf, Bruce Christianson

Fast cluster detection in networks by first-order optimization
Immanuel Bomze, Francesco Rinaldi, Damiano Zeffiro

Complexity of Projected Newton Methods for Bound-constrained Optimization
Yue Xie, Stephen Wright

Scalable adaptive cubic regularization methods
Jean-Pierre Dussault, Dominique Orban

Optimization Software and Modeling Systems

Controllable Transmission Networks UnderDemand Uncertainty with Modular FACTS
Alireza Soroudi

Robust Optimization

A nonparametric algorithm for optimal stopping based on robust optimization
Bradley Sturt

Semi-Discrete Optimal Transport: Hardness, Regularization and Numerical Solution
Bahar Taskesen, Soroosh Shafieezadeh-Abadeh, Daniel Kuhn

Stochastic Programming

Exact algorithms for the 0-1 Time-bomb Knapsack Problem
Michele Monaci, Ciara Pike-Burke, Alberto Santini


  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository

 

Submit
Update
Policies
Coordinator's Board
Classification Scheme
Credits
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society