Two-Stage Stochastic Matching and Spanning Tree Problems: Polynomial Instances and Approximation

European Journal of Operational Research - Netherlands
doi 10.1016/j.ejor.2009.12.004
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Elsevier BV

Related search

Discrete Approximation of Two-Stage Stochastic and Distributionally Robust Linear Complementarity Problems

Mathematical Programming, Series B
MathematicsSoftware
2018English

Polynomial Time Approximation Schemes for Dense Instances of NP-Hard Problems

Journal of Computer and System Sciences
Computer NetworksApplied MathematicsCommunicationsComputational TheoryMathematicsTheoretical Computer Science
1999English

Polynomial Approximation Method for Stochastic Programming.

English

Correspondence Matching Among Stereo Images With Object Flow and Minimum Spanning Tree Aggregation

International Journal of Advanced Robotic Systems
2018English

Two‐stage Stochastic Minimum S − T Cut Problems: Formulations, Complexity and Decomposition Algorithms

Networks
Information SystemsComputer NetworksHardwareCommunicationsArchitectureSoftware
2019English

Offline Algorithms for Dynamic Minimum Spanning Tree Problems

Journal of Algorithms
1994English

Approximation Complexity of Min-Max (Regret) Versions of Shortest Path, Spanning Tree, and Knapsack

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2005English

Improved Approximation Results for Stochastic Knapsack Problems

2011English

Numerical Methods and Approximation and Modelling Problems in Stochastic Control Theory.

1984English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy