An active set algorithm for robust combinatorial optimization based on separation oracles
From MaRDI portal
Publication:5919428
DOI10.1007/s12532-019-00160-8zbMath1461.90116arXiv1804.02239OpenAlexW2962901967WikidataQ127971002 ScholiaQ127971002MaRDI QIDQ5919428
Marianna De Santis, Christoph Buchheim
Publication date: 17 February 2020
Published in: Advances in Computational Mathematics, Mathematical Programming Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1804.02239
Convex programming (90C25) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Robustness in mathematical programming (90C17)
Related Items (2)
An oracle-based framework for robust combinatorial optimization ⋮ Submodularity in Conic Quadratic Mixed 0–1 Optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A divide-and-conquer fast finite difference method for space-time fractional partial differential equation
- Robust combinatorial optimization under convex and discrete cost uncertainty
- The analysis of fractional differential equations. An application-oriented exposition using differential operators of Caputo type
- Robust solutions of uncertain linear programs
- Robust discrete optimization and its applications
- A note on the well-posedness of terminal value problems for fractional differential equations
- A Frank-Wolfe based branch-and-bound algorithm for mean-risk optimization
- Variable order and distributed order fractional operators
- Simplex QP-based methods for minimizing a conic quadratic objective over polyhedra
- New integral inequalities with weakly singular kernel for discontinuous functions and their applications to impulsive fractional differential systems
- A fast direct method for block triangular Toeplitz-like with tri-diagonal block systems from time-fractional partial differential equations
- Lectures on Modern Convex Optimization
- Robust Convex Optimization
- A Feasible Active Set Method with Reoptimization for Convex Quadratic Mixed-Integer Programming
- A Generalized Spectral Collocation Method with Tunable Accuracy for Variable-Order Fractional Differential Equations
- Numerical Methods for the Variable-Order Fractional Advection-Diffusion Equation with a Nonlinear Source Term
- Lévy Processes and Stochastic Calculus
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Fast Evaluation of the Caputo Fractional Derivative and its Applications to Fractional Diffusion Equations
- Optimal Inequalities in Probability Theory: A Convex Optimization Approach
- Error Analysis of a Finite Difference Method on Graded Meshes for a Time-Fractional Diffusion Equation
- Generalized Inversion of Modified Matrices
- Stochastic models for fractional calculus
- Benchmarking optimization software with performance profiles.
This page was built for publication: An active set algorithm for robust combinatorial optimization based on separation oracles
