Works matching IS 00255610 AND DT 2018 AND VI 172 AND IP 1/2
Results: 27
Preface.
- Published in:
- Mathematical Programming, 2018, v. 172, n. 1/2, p. 1, doi. 10.1007/s10107-018-1332-y
- By:
- Publication type:
- Article
Maximizing monotone submodular functions over the integer lattice.
- Published in:
- Mathematical Programming, 2018, v. 172, n. 1/2, p. 539, doi. 10.1007/s10107-018-1324-y
- By:
- Publication type:
- Article
Robust monotone submodular function maximization.
- Published in:
- Mathematical Programming, 2018, v. 172, n. 1/2, p. 505, doi. 10.1007/s10107-018-1320-2
- By:
- Publication type:
- Article
Strong reductions for extended formulations.
- Published in:
- Mathematical Programming, 2018, v. 172, n. 1/2, p. 591, doi. 10.1007/s10107-018-1316-y
- 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
On some polytopes contained in the 0, 1 hypercube that have a small Chvátal rank.
- Published in:
- Mathematical Programming, 2018, v. 172, n. 1/2, p. 467, doi. 10.1007/s10107-017-1226-4
- By:
- Publication type:
- Article
A polyhedral approach to online bipartite matching.
- Published in:
- Mathematical Programming, 2018, v. 172, n. 1/2, p. 443, doi. 10.1007/s10107-017-1219-3
- By:
- Publication type:
- Article
Submodular unsplittable flow on trees.
- Published in:
- Mathematical Programming, 2018, v. 172, n. 1/2, p. 565, doi. 10.1007/s10107-017-1218-4
- By:
- Publication type:
- Article
Improved approximations for cubic bipartite and cubic TSP.
- Published in:
- Mathematical Programming, 2018, v. 172, n. 1/2, p. 399, doi. 10.1007/s10107-017-1211-y
- By:
- Publication type:
- Article
Better s-t-tours by Gao trees.
- Published in:
- Mathematical Programming, 2018, v. 172, n. 1/2, p. 191, doi. 10.1007/s10107-017-1202-z
- By:
- Publication type:
- Article
Valid inequalities for separable concave constraints with indicator variables.
- Published in:
- Mathematical Programming, 2018, v. 172, n. 1/2, p. 415, doi. 10.1007/s10107-017-1197-5
- By:
- Publication type:
- Article
Ellipsoidal mixed-integer representability.
- Published in:
- Mathematical Programming, 2018, v. 172, n. 1/2, p. 351, doi. 10.1007/s10107-017-1196-6
- By:
- Publication type:
- Article
Constant factor approximation for ATSP with two edge weights.
- Published in:
- Mathematical Programming, 2018, v. 172, n. 1/2, p. 371, doi. 10.1007/s10107-017-1195-7
- By:
- Publication type:
- Article
Polyhedral approximation in mixed-integer convex optimization.
- Published in:
- Mathematical Programming, 2018, v. 172, n. 1/2, p. 139, doi. 10.1007/s10107-017-1191-y
- By:
- Publication type:
- Article
On quantile cuts and their closure for chance constrained optimization problems.
- Published in:
- Mathematical Programming, 2018, v. 172, n. 1/2, p. 621, doi. 10.1007/s10107-017-1190-z
- By:
- Publication type:
- Article
On the use of intersection cuts for bilevel optimization.
- Published in:
- Mathematical Programming, 2018, v. 172, n. 1/2, p. 77, doi. 10.1007/s10107-017-1189-5
- By:
- Publication type:
- Article
Extreme functions with an arbitrary number of slopes.
- Published in:
- Mathematical Programming, 2018, v. 172, n. 1/2, p. 303, doi. 10.1007/s10107-017-1184-x
- By:
- Publication type:
- Article
Popular edges and dominant matchings.
- Published in:
- Mathematical Programming, 2018, v. 172, n. 1/2, p. 209, doi. 10.1007/s10107-017-1183-y
- By:
- Publication type:
- Article
On approximation algorithms for concave mixed-integer quadratic programming.
- Published in:
- Mathematical Programming, 2018, v. 172, n. 1/2, p. 3, doi. 10.1007/s10107-017-1178-8
- By:
- Publication type:
- Article
Stabilizing network bargaining games by blocking players.
- Published in:
- Mathematical Programming, 2018, v. 172, n. 1/2, p. 249, doi. 10.1007/s10107-017-1177-9
- By:
- Publication type:
- Article
Approximating graph-constrained max-cut.
- Published in:
- Mathematical Programming, 2018, v. 172, n. 1/2, p. 35, doi. 10.1007/s10107-017-1154-3
- By:
- Publication type:
- Article
Minimal cut-generating functions are nearly extreme.
- Published in:
- Mathematical Programming, 2018, v. 172, n. 1/2, p. 329, doi. 10.1007/s10107-017-1153-4
- By:
- Publication type:
- Article
Semidefinite and linear programming integrality gaps for scheduling identical machines.
- Published in:
- Mathematical Programming, 2018, v. 172, n. 1/2, p. 231, doi. 10.1007/s10107-017-1152-5
- By:
- Publication type:
- Article
Exact algorithms for the chance-constrained vehicle routing problem.
- Published in:
- Mathematical Programming, 2018, v. 172, n. 1/2, p. 105, doi. 10.1007/s10107-017-1151-6
- By:
- Publication type:
- Article
Approximating min-cost chain-constrained spanning trees: a reduction from weighted to unweighted problems.
- Published in:
- Mathematical Programming, 2018, v. 172, n. 1/2, p. 17, doi. 10.1007/s10107-017-1150-7
- By:
- Publication type:
- Article
Round-robin tournaments generated by the Circle Method have maximum carry-over.
- Published in:
- Mathematical Programming, 2018, v. 172, n. 1/2, p. 277, doi. 10.1007/s10107-017-1115-x
- By:
- Publication type:
- Article
k-Trails: recognition, complexity, and approximations.
- Published in:
- Mathematical Programming, 2018, v. 172, n. 1/2, p. 169, doi. 10.1007/s10107-017-1113-z
- By:
- Publication type:
- Article