Found: 21
Select item for more details and to access through your institution.
Discrete 2-convex functions.
- Published in:
- Mathematical Programming, 2022, v. 195, n. 1/2, p. 831, doi. 10.1007/s10107-021-01717-z
- By:
- Publication type:
- Article
Matroids Are Immune to Braess' Paradox.
- Published in:
- Mathematics of Operations Research, 2017, v. 42, n. 3, p. 745, doi. 10.1287/moor.2016.0825
- By:
- Publication type:
- Article
A Structure Theory for the Parametric Submodular Intersection Problem.
- Published in:
- Mathematics of Operations Research, 2009, v. 34, n. 3, p. 513, doi. 10.1287/moor.1090.0395
- By:
- Publication type:
- Article
A Two-Sided Discrete-Concave Market with Possibly Bounded Side Payments: An Approach by Discrete Convex Analysis.
- Published in:
- Mathematics of Operations Research, 2007, v. 32, n. 1, p. 136, doi. 10.1287/moor.1070.0227
- By:
- Publication type:
- Article
A NOTE ON KELSO AND CRAWFORD'S GROSS SUBSTITUTES CONDITION.
- Published in:
- Mathematics of Operations Research, 2003, v. 28, n. 3, p. 463, doi. 10.1287/moor.28.3.463.16393
- By:
- Publication type:
- Article
A STRONGLY POLYNOMIAL ALGORITHM FOR MINIMAL COST SUBMODULAR FLOW PROBLEMS.
- Published in:
- Mathematics of Operations Research, 1989, v. 14, n. 1, p. 60, doi. 10.1287/moor.14.1.60
- By:
- Publication type:
- Article
THE FAIR RESOURCE ALLOCATION PROBLEM WITH SUBMODULAR CONSTRAINTS.
- Published in:
- Mathematics of Operations Research, 1988, v. 13, n. 1, p. 164, doi. 10.1287/moor.13.1.164
- By:
- Publication type:
- Article
LEXICOGRAPHICALLY OPTIMAL BASE OF A POLYMATROID WITH RESPECT TO A WEIGHT VECTOR.
- Published in:
- Mathematics of Operations Research, 1980, v. 5, n. 2, p. 186, doi. 10.1287/moor.5.2.186
- By:
- Publication type:
- Article
Greedy systems of linear inequalities and lexicographically optimal solutions.
- Published in:
- RAIRO -- Operations Research, 2019, v. 53, n. 5, p. 1929, doi. 10.1051/ro/2019001
- By:
- Publication type:
- Article
Submodular optimization views on the random assignment problem.
- Published in:
- Mathematical Programming, 2019, v. 178, n. 1/2, p. 485, doi. 10.1007/s10107-018-1310-4
- By:
- Publication type:
- Article
Polynomial combinatorial algorithms for skew-bisubmodular function minimization.
- Published in:
- Mathematical Programming, 2018, v. 171, n. 1/2, p. 87, doi. 10.1007/s10107-017-1171-2
- By:
- Publication type:
- Article
Dual consistent systems of linear inequalities and cardinality constrained polytopes.
- Published in:
- Mathematical Programming, 2015, v. 150, n. 1, p. 35, doi. 10.1007/s10107-014-0748-2
- By:
- Publication type:
- Article
A note on polylinking flow networks.
- Published in:
- Mathematical Programming, 2013, v. 137, n. 1/2, p. 601, doi. 10.1007/s10107-011-0502-y
- By:
- Publication type:
- Article
Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization.
- Published in:
- Mathematical Programming, 2010, v. 122, n. 1, p. 87, doi. 10.1007/s10107-008-0242-9
- By:
- Publication type:
- Article
A general model for matroids and the greedy algorithm.
- Published in:
- Mathematical Programming, 2009, v. 119, n. 2, p. 353, doi. 10.1007/s10107-008-0213-1
- By:
- Publication type:
- Article
A descent method for submodular function minimization.
- Published in:
- Mathematical Programming, 2002, v. 92, n. 2, p. 387, doi. 10.1007/s101070100273
- By:
- Publication type:
- Article
Notes on L-/M-convex functions and the separation theorems.
- Published in:
- Mathematical Programming, 2000, v. 88, n. 1, p. 129, doi. 10.1007/PL00011371
- By:
- Publication type:
- Article
A note on Faigle and Kern's dual greedy polyhedra.
- Published in:
- Mathematical Programming, 2000, v. 88, n. 1, p. 217, doi. 10.1007/s101070050013
- By:
- Publication type:
- Article
A note on the problem of updating shortest paths.
- Published in:
- Networks, 1981, v. 11, n. 3, p. 317, doi. 10.1002/net.3230110309
- By:
- Publication type:
- Article
Barter markets, indivisibilities, and Markovian core.
- Published in:
- Bulletin of Economic Research, 2022, v. 74, n. 1, p. 39, doi. 10.1111/boer.12279
- By:
- Publication type:
- Article
On the feasible payoff set of two-player repeated games with unequal discounting.
- Published in:
- International Journal of Game Theory, 2013, v. 42, n. 1, p. 295, doi. 10.1007/s00182-012-0354-6
- By:
- Publication type:
- Article