Recovery-to-optimality: a new two-stage approach to robustness with an application to aperiodic timetabling (Q337170): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(8 intermediate revisions by 5 users not shown)
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90B35 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C31 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C15 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6650726 / rank
 
Normal rank
Property / zbMATH Keywords
 
robust optimization
Property / zbMATH Keywords: robust optimization / rank
 
Normal rank
Property / zbMATH Keywords
 
recoverable robustness
Property / zbMATH Keywords: recoverable robustness / rank
 
Normal rank
Property / zbMATH Keywords
 
robust timetabling
Property / zbMATH Keywords: robust timetabling / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Gurobi / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: PESPLib / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: LinTim / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Netlib / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.cor.2014.06.025 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2077832238 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Empirical Analysis of Robustness Concepts for Timetabling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust Convex Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3182207 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adjustable robust counterpart of conic quadratic problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Light Robustness / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Concept of Recoverable Robustness, Linear Programming Recovery, and Railway Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust Optimization for Empty Repositioning Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust discrete optimization and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adjustable robust solutions of uncertain linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3085146 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to Stochastic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3147656 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4203976 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Localization in single facility location / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hull properties in location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the \(\epsilon\)-perturbation method for avoiding degeneracy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Project scheduling under uncertainty: survey and research potentials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Location Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recoverable Robust Timetables on Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recoverable Robustness in Shunting and Timetabling / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Bicriteria Approach for Robust Timetabling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-stage recovery robustness for optimization problems: A new concept for planning under disturbances / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nominal and robust train timetabling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Price of Robustness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recoverable Robust Timetables: An Algorithmic Approach on Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2867368 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Algorithms for Recoverable Robustness Problems. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Mathematical Model for Periodic Scheduling Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Periodic Timetable Optimisation Problems by Modulo Simplex Calculations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving the modulo simplex algorithm for large-scale periodic timetabling / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 22:48, 12 July 2024

scientific article
Language Label Description Also known as
English
Recovery-to-optimality: a new two-stage approach to robustness with an application to aperiodic timetabling
scientific article

    Statements

    Recovery-to-optimality: a new two-stage approach to robustness with an application to aperiodic timetabling (English)
    0 references
    0 references
    0 references
    10 November 2016
    0 references
    0 references
    0 references
    0 references
    0 references
    robust optimization
    0 references
    recoverable robustness
    0 references
    robust timetabling
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references