-

 

 

 




Optimization Online





 

All Areas Submissions - September 2017

Integer Programming
Exploiting sparsity for the min k-partition problem
Guanglei Wang, Hassan Hijazi

Combinatorial Optimization
Two-Dimensional Maximum p-Coverage Problem with Partial Coverage
Manish Bansal

Other Topics
Time-Indexed Relaxations for the Online Bipartite Matching Problem
Alfredo Torrico, Alejandro Toriello

Integer Programming
Shaping and Trimming Branch-and-bound Trees
Philipp M. Christophel, Imre Polik

Nonlinear Optimization
A sequential optimality condition related to the quasinormality constraint qualification and its algorithmic consequences
R. Andreani, N. S. Fazzio, M. L. Schuverdt, L. D. Secchin

Other Topics
FPBH.jl: A Feasibility Pump Based Heuristic for Multi-objective Mixed Integer Linear Programming in Julia
Aritra Pal, Hadi Charkhgard

Network Optimization
Parsimonious formulations for low-diameter clusters
Austin Buchanan, Hosseinali Salemi

Linear, Cone and Semidefinite Programming
Perturbation analysis of nonlinear semidefinite programming under Jacobian uniqueness conditions
Ziran Yin, Liwei Zhang

Nonlinear Optimization
Complementarity-Based Nonlinear Programming Techniques for Optimal Mixing in Gas Networks
Falk M. Hante, Martin Schmidt

Robust Optimization
Robust Combinatorial Optimization under Convex and Discrete Cost Uncertainty
Christoph Buchheim, Jannis Kurtz

Linear, Cone and Semidefinite Programming
Perturbation analysis of a class of conic programming problems under Jacobian uniqueness conditions
Ziran Yin, Liwei Zhang

Stochastic Programming
Modeling Time-dependent Randomness in Stochastic Dual Dynamic Programming
Nils Löhndorf, Alexander Shapiro

Combinatorial Optimization
Comparative Analysis of Capacitated Arc Routing Formulations for Branch-Cut-and-Price Algorithms
Diego Pecin, Eduardo Uchoa

Combinatorial Optimization
A General Regularized Continuous Formulation for the Maximum Clique Problem
James T. Hungerford, Francesco Rinaldi

Convex and Nonsmooth Optimization
Convergence Analysis of Processes with Valiant Projection Operators in Hilbert Space
Yair Censor, Rafiq Mansour

Nonlinear Optimization
A convergence frame for inexact nonconvex and nonsmooth algorithms and its applications to several iterations
Sun Tao, Jiang Hao, Cheng Lizhi, Zhu Wei

Applications — OR and Management Sciences
Same-Day Delivery with Drone Resupply
Iman Dayarian, Martin Savelsbergh, John-Paul Clarke

Linear, Cone and Semidefinite Programming
Worst-case convergence analysis of gradient and Newton methods through semidefinite programming performance estimation
Etienne De Klerk, Francois Glineur, Adrien Taylor

Convex and Nonsmooth Optimization
An incremental mirror descent subgradient algorithm with random sweeping and proximal step
Radu Ioan Bot, Axel Böhm

Convex and Nonsmooth Optimization
Inner Conditions for Error Bounds and Metric Subregulerity of Multifunctions
D. Azé

Nonlinear Optimization
Iteratively Linearized Reweighted Alternating Direction Method of Multipliers for a Class of Nonconvex Problems
Sun Tao, Jiang Hao , Cheng Lizhi

Applications — OR and Management Sciences
Computation of exact bootstrap confidence intervals: complexity and deterministic algorithms
Dimitris Bertsimas, Bradley Sturt

Linear, Cone and Semidefinite Programming
Maintaining a Basis Matrix in the Linear Programming Interior Point Method
Lukas Schork, Jacek Gondzio

Applications — Science and Engineering
On the use of the saddle formulation in weakly-constrained 4D-VAR data assimilation
Serge Gratton, Selime Gürol, Ehouarn Simon, Philippe Toint

Nonlinear Optimization
Worst-case evaluation complexity and optimality of second-order methods for nonconvex smooth optimization
Coralia Cartis, Nicholas I. M. Gould, Philippe L. Toint

Applications — OR and Management Sciences
Partially-Ranked Choice Models for Data-Driven Assortment Optimization
Sanjay Dominik Jena, Andrea Lodi, Hugo Palmer

Combinatorial Optimization
The Vertex k-cut Problem
Denis Cornaz, Fabio Furini, Mathieu Lacroix, Enrico Malaguti, A. Ridha Mahjoub, Sébastien Martin

Combinatorial Optimization
A Note on Submodular Function Minimization by Chubanov's LP Algorithm
Satoru Fujishige

Applications — OR and Management Sciences
Resilient Course and Instructor Scheduling in the Mathematics Department at the United States Naval Academy
Stephen J. Ward, Joseph Foraker, Nelson A. Uhan

Applications — OR and Management Sciences
A Criterion Space Search Algorithm for Biobjective Mixed Integer Programming: the Boxed Line Method
Tyler Perini, Natashia Boland, Diego Pecin, Martin Savelsbergh

Applications — OR and Management Sciences
Constraints reduction programming by subset selection: a study from numerical aspect
Yuan Shen

Robust Optimization
Constraint Generation for Two-Stage Robust Network Flow Problem
David Simchi-Levi, He Wang, Yehua Wei

Integer Programming
Double-Perspective Functions for Mixed-Integer Fractional Programs with Indicator Variables
Adam N. Letchford, Qiang Ni, Zhaoyu Zhong

Nonlinear Optimization
A note on preconditioning weighted linear least squares, with consequences for weakly-constrained variational data assimilation
Serge Gratton, Selime Gürol, Ehouarn Simon, Philippe Toint

Robust Optimization
Robust combinatorial optimization with knapsack uncertainty
M. Poss

Convex and Nonsmooth Optimization
Linearized version of the generalized alternating direction method of multipliers for three-block separable convex minimization problem
Zhang Xue-Qing , Peng Jian-Wen

Nonlinear Optimization
An Inexact Regularized Newton Framework with a Worst-Case Iteration Complexity of $\mathcal{O}(\epsilon^{-3/2})$ for Nonconvex Optimization
Frank E. Curtis, Daniel P. Robinson, Mohammadreza Samadi

Nonlinear Optimization
Large-scale packing of ellipsoids
E. G. Birgin, R. D. Lobato

Convex and Nonsmooth Optimization
Optimal Linearized Alternating Direction Method of Multipliers for Convex Programming
Bingsheng He, Feng Ma, Xiaoming Yuan

Applications — OR and Management Sciences
Robust Sensitivity Analysis for Linear Programming with Ellipsoidal Perturbation
Ruotian Gao, Wenxun Xing

Integer Programming
A mixed-integer branching approach for very small formulations of disjunctive constraints
Joey Huchette, Juan Pablo Vielma

Integer Programming
A novel branch-and-bound algorithm for quadratic mixed-integer problems with quadratic constraints
Simone Goettlich, Kathinka Hameister, Michael Herty

Robust Optimization
Time inconsistency of optimal policies of distributionally robust inventory models
Alexander Shapiro, Linwei Xin

Integer Programming
Lower bounds on the lattice-free rank for packing and covering integer programs
Merve Bodur, Alberto Del Pia, Santanu S. Dey, Marco Molinaro

Integer Programming
Compact Representation of Near-Optimal Integer Programming Solutions
Thiago Serra, John Hooker


  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