OpenAlex
PricingAboutJobs
Log inGet started
Work

An active set algorithm for robust combinatorial optimization based on separation oracles

HTML PDF

Year: 2019
Type: article
Source: Mathematical Programming Computation
DOI: 10.1007/s12532-019-00160-8
Authors: Christoph Buchheim, Marianna De Santis
Institutions: TU Dortmund University, Sapienza University of Rome
Language: English

Topic: Advanced Optimization Algorithms Research
Subfield: Numerical Analysis
Field: Mathematics
Domain: Physical Sciences
Keywords: ellipsoidal uncertainty, separation oracle, active set algorithm, second-order cone programming, mixed-integer second-order cone programming, branch and bound, Lagrangian dual, dual bounds, shortest path, traveling salesman problem

Open Access status: green

Funder: Horizon 2020 Framework Programme
Award: G3374013012
OpenAlex ID: W2795823709
FWCI: 0.415
Cites: 21
Cited by: 4
Related to: 10
OpenAlex
Nonprofit
Open DataOpen Data
Open Source
Product
Search
Compare
Pricing
Repositories
Unpaywall
Unsub
Developers
API docs
Data snapshot
Status
Source code
Organization
About
Team
Testimonials
Brand
Jobs
Community
Help center
Contact
Events
Blog
Mailing list
Supporters
Legal
Privacy
Accessibility
Terms
Security