Amanote Research
Register
Sign In
Discover open access scientific publications
Search, annotate, share and cite publications
Publications by Bruno Escoffier
Two-Stage Stochastic Matching and Spanning Tree Problems: Polynomial Instances and Approximation
European Journal of Operational Research
Information Systems
Simulation
Management Science
Management
Computer Science
Modeling
Operations Research
Strategy-Proof Mechanisms for Facility Location Games With Many Facilities
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Related publications
Discrete Approximation of Two-Stage Stochastic and Distributionally Robust Linear Complementarity Problems
Mathematical Programming, Series B
Mathematics
Software
Polynomial Time Approximation Schemes for Dense Instances of NP-Hard Problems
Journal of Computer and System Sciences
Computer Networks
Applied Mathematics
Communications
Computational Theory
Mathematics
Theoretical Computer Science
Polynomial Approximation Method for Stochastic Programming.
Correspondence Matching Among Stereo Images With Object Flow and Minimum Spanning Tree Aggregation
International Journal of Advanced Robotic Systems
Two‐stage Stochastic Minimum S − T Cut Problems: Formulations, Complexity and Decomposition Algorithms
Networks
Information Systems
Computer Networks
Hardware
Communications
Architecture
Software
Offline Algorithms for Dynamic Minimum Spanning Tree Problems
Journal of Algorithms
Approximation Complexity of Min-Max (Regret) Versions of Shortest Path, Spanning Tree, and Knapsack
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Improved Approximation Results for Stochastic Knapsack Problems
Numerical Methods and Approximation and Modelling Problems in Stochastic Control Theory.
