Found: 13
Select item for more details and to access through your institution.
Mathematical Optimization for Fair Social Decisions: A Tribute to Michel Balinski.
- Published in:
- Mathematical Programming, 2024, v. 203, n. 1/2, p. 1, doi. 10.1007/s10107-023-02050-3
- By:
- Publication type:
- Article
ERRATUM:THE STABLE ALLOCATION (OR ORDINAL TRANSPORTATION)PROBLEM.
- Published in:
- 2002
- By:
- Publication type:
- Correction Notice
THE STABLE ALLOCATION (OR ORDINAL TRANSPORTATION) PROBLEM.
- Published in:
- Mathematics of Operations Research, 2002, v. 27, n. 3, p. 485, doi. 10.1287/moor.27.3.485.310
- By:
- Publication type:
- Article
Lagrangian bounds for large‐scale multicommodity network design: a comparison between Volume and Bundle methods.
- Published in:
- International Transactions in Operational Research, 2021, v. 28, n. 1, p. 296, doi. 10.1111/itor.12770
- By:
- Publication type:
- Article
On the star forest polytope for trees and cycles.
- Published in:
- RAIRO -- Operations Research, 2019, v. 53, n. 5, p. 1763, doi. 10.1051/ro/2018076
- By:
- Publication type:
- Article
PREFACE.
- Published in:
- RAIRO -- Operations Research, 2016, v. 50, n. 2, p. 221, doi. 10.1051/ro/2016004
- By:
- Publication type:
- Article
A polyhedral study of a two level facility location model.
- Published in:
- RAIRO -- Operations Research, 2014, v. 48, n. 2, p. 153, doi. 10.1051/ro/2014003
- By:
- Publication type:
- Article
Network strength games: the core and the nucleolus.
- Published in:
- Mathematical Programming, 2020, v. 180, n. 1/2, p. 117, doi. 10.1007/s10107-018-1348-3
- By:
- Publication type:
- Article
Sparsest cut in planar graphs, maximum concurrent flows and their connections with the max-cut problem.
- Published in:
- Mathematical Programming, 2018, v. 172, n. 1/2, p. 59, doi. 10.1007/s10107-017-1227-3
- By:
- Publication type:
- Article
The stable admissions polytope.
- Published in:
- Mathematical Programming, 2000, v. 87, n. 3, p. 427
- By:
- Publication type:
- Article
Generalized nash fairness solutions for bi‐objective minimization problems.
- Published in:
- Networks, 2024, v. 83, n. 1, p. 83, doi. 10.1002/net.22182
- By:
- Publication type:
- Article
On the <italic>p</italic>‐median polytope and the odd directed cycle inequalities: Oriented graphs.
- Published in:
- Networks, 2018, v. 71, n. 4, p. 326, doi. 10.1002/net.21813
- By:
- Publication type:
- Article
A linear programming approach to increasing the weight of all minimum spanning trees.
- Published in:
- Networks, 2008, v. 52, n. 4, p. 227, doi. 10.1002/net.20242
- By:
- Publication type:
- Article