-

 

 

 




Optimization Online





 

All Areas Submissions - September 2011

Network Optimization
Dynamic Graph Generation for Large Scale Operational Train Timetabling
Frank Fischer, Christoph Helmberg

Network Optimization
Distributed Basis Pursuit
J. F. C. Mota, J. M. F. Xavier, P. M. Q. Aguiar, M. Püschel

Network Optimization
A comparison of routing sets for robust network design
Michael Poss

Other Topics
Simulation Optimization for the Stochastic Economic Lot Scheduling Problem
Nils Loehndorf, Stefan Minner

Nonlinear Optimization
Trajectory-following methods for large-scale degenerate convex quadratic programming
Nick Gould, Dominique Orban, Daniel Robinson

Combinatorial Optimization
Facets for the Maximum Common Induced Subgraph Problem Polytope
Breno Piva, Cid de Souza

Nonlinear Optimization
Adjoint Sensitivity Analysis for Numerical Weather Prediction: Applications to Power Grid Optimization
Alexandru Cioaca, Victor M. Zavala, Emil M. Constantinescu

Integer Programming
Strong Branching Inequalities for Convex Mixed Integer Nonlinear Programs
Mustafa Kilinc, Jeff Linderoth, James Luedtke, Andrew Miller

Integer Programming
Lower bounds for Chvátal-Gomory style operators
Sebastian Pokutta

Nonlinear Optimization
An FPTAS for Optimizing a Class of Low-Rank Functions Over a Polytope
Shashi Mittal, Andreas S. Schulz

Combinatorial Optimization
A General Framework for Designing Approximation Schemes for Combinatorial Optimization Problems with Many Objectives Combined Into One
Shashi Mittal, Andreas S. schulz

Applications — Science and Engineering
A two-phase method for selecting IMRT treatment beam angles: Branch-and-Prune and local neighborhood
Gino Lim, Wenhua Cao

Applications — Science and Engineering
Optimal synthesis in the Reeds and Shepp problem with a free final direction
Andrey Dmitruk, Ivan Samylovskiy

Convex and Nonsmooth Optimization
An inexact accelerated proximal gradient method for large scale linearly constrained convex SDP
K.F. Jiang, D.F. Sun, K.C. Toh

Convex and Nonsmooth Optimization
On the O(1/t) convergence rate of alternating direction method
Bingsheng He, Xiaoming Yuan

Nonlinear Optimization
Global Convergence of General Filter Algorithms
Gislaine Aparecida Periçaro, Ademir Alves Ribeiro, Elizabeth Wegner Karas

Convex and Nonsmooth Optimization
Multi-target Linear-quadratic control problem: semi-infinite interval
L. Faybusovich, T Mouktonglang

Applications — Science and Engineering
Compressive Sensing Based High Resolution Channel Estimation for OFDM System
Jia Jasmine Meng, Wotao Yin, Yingying Li, Nam Tuan Nguyen, Zhu Han

Convex and Nonsmooth Optimization
Decomposition methods based on projected gradient for network equilibrium problems
Andrea Cassioli, David Di Lorenzo, Marco Sciandrone

Applications — OR and Management Sciences
Robust management and pricing of LNG contracts with cancellation options
Vincent Guigues, Claudia Sagastizábal, Jorge Zubelli

Linear, Cone and Semidefinite Programming
Properties of a Cutting Plane Method for Semidefinite Programming
Kartik K. Sivaramakrishnan, John E. Mitchell

Stochastic Programming
On Kusuoka representation of law invariant risk measures
Alexander Shapiro

Applications — OR and Management Sciences
Managing Operational and Financing Decisions to Meet Consumption Targets
Lucy Gongtao Chen, Zhuoyu Long, Sim Melvyn

Combinatorial Optimization
On Minimum Changeover Cost Arborescences
Stefano Gualandi, Giulia Galbiati, Francesco Maffioli

Applications — OR and Management Sciences
Improving Robust Rolling Stock Circulation in Rapid Transit Networks
Luís Cadarso, Ángel Marín

Applications — OR and Management Sciences
Stochastic approaches for solving Rapid Transit Network Design models with random demand
Gemayqzel bouza, Ángel Marín

Stochastic Programming
A copula-based heuristic for scenario generation
Michal Kaut

Linear, Cone and Semidefinite Programming
A smooth perceptron algorithm
Negar Soheili, Javier Pena

Stochastic Programming
Exploiting structure of autoregressive processes in risk-averse multistage stochastic linear programs
Vincent Guigues, Claudia Sagastizábal

Integer Programming
Unbounded Convex Sets for Non-Convex Mixed-Integer Quadratic Programming
Samuel Burer, Adam Letchford

Integer Programming
A (k+1)-Slope Theorem for the k-Dimensional Infinite Group Relaxation
Amitabh Basu, Robert Hildebrand, Matthias Koeppe, Marco Molinaro

Robust Optimization
Robust Network Design: Formulations, Valid Inequalities, and Computations
Arie M.C.A. Koster, Manuel Kutschka, Christian Raack

Integer Programming
Lattice-free sets, branching disjunctions, and mixed-integer programming
Sanjeeb Dash, Neil Dobbs, Oktay Gunluk, Tomasz Nowicki, Grzegorz Swirszcz

Convex and Nonsmooth Optimization
A First Order Method for Finding Minimal Norm-Like Solutions of Convex Optimization Problems
Amir Beck, Shoham Sabach

Complementarity and Variational Inequalities
An LP-Newton Method: Nonsmooth Equations, KKT Systems, and Nonisolated Solutions
Francisco Facchinei, Andreas Fischer, Markus Herrich

Optimization Software and Modeling Systems
PuLP: A Linear Programming Toolkit for Python
Stuart Mitchell, Michael O'Sullivan, Iain Dunning

Combinatorial Optimization
COIN-OR METSlib: a Metaheuristics Framework in Modern C++.
Mirko Maischberger

Convex and Nonsmooth Optimization
On the connection of facially exposed, and nice cones
Gabor Pataki

Nonlinear Optimization
A short note on the global convergence of the unmodified PRP method
Weijun Zhou

Integer Programming
Orbital shrinking
Matteo Fischetti, Leo Liberti

Stochastic Programming
Branch-and-cut Approaches for Chance-constrained Formulations of Reliable Network Design Problems
Yongjia Song, James Luedtke

Nonlinear Optimization
Conjugate gradient methods based on secant conditions that generate descent search directions for unconstrained optimization
Y Narushima, H Yabe

Nonlinear Optimization
Subspace accelerated matrix splitting algorithms for bound-constrained quadratic programming and linear complementarity problems
Daniel Robinson, Liming Feng, Jorge Nocedal, Jong-Shi Pang

Integer Programming
Mixed n-Step MIR Inequalities: Facets for the n-Mixing Set
Sujeevraja Sanjeevi, Kiavash Kianfar

Linear, Cone and Semidefinite Programming
Curvature Integrals and Iteration Complexities in SDP and Symmetric Cone Programs
Satoshi Kakihara, Atsumi Ohara, Takashi Tsuchiya

Linear, Cone and Semidefinite Programming
Information Geometry and Interior-Point Algorithms in SDP and Symmetric Cone Programs
Satoshi Kakihara, Atsumi Ohara, Takashi Tsuchiya

Combinatorial Optimization
Interdiction Branching
Andrea Lodi, Ted Ralphs, Fabrizio Rossi, Stefano Smriglio

Other Topics
Welfare-Maximizing Correlated Equilibria using Kantorovich Polynomials with Sparsity
Fook Wai Kong, Berc Rustem

Integer Programming
More Branch-and-Bound Experiments in Convex Nonlinear Integer Programming
Pierre Bonami, Jon Lee, Sven Leyffer, Andreas Wächter


  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