Special Issue: Integer Programming and Combinatorial Optimization (IPCO) 2020.
- Published in:
- Mathematical Programming, 2022, v. 192, n. 1/2, p. 1, doi. 10.1007/s10107-022-01782-y
- By:
- Publication type:
- Article
Works matching IS 00255610 AND DT 2022 AND VI 192 AND IP 1/2
Results: 27
1
2
Correction to: Idealness of k-wise intersecting families.
- Published in:
- Mathematical Programming, 2022, v. 192, n. 1/2, p. 51, doi. 10.1007/s10107-022-01773-z
- By:
- Publication type:
- Article
3
Stochastic makespan minimization in structured set systems.
- Published in:
- Mathematical Programming, 2022, v. 192, n. 1/2, p. 597, doi. 10.1007/s10107-021-01741-z
- By:
- Publication type:
- Article
4
Maximal quadratic-free sets.
- Published in:
- Mathematical Programming, 2022, v. 192, n. 1/2, p. 229, doi. 10.1007/s10107-021-01738-8
- By:
- Publication type:
- Article
5
Ideal formulations for constrained convex optimization problems with indicator variables.
- Published in:
- Mathematical Programming, 2022, v. 192, n. 1/2, p. 57, doi. 10.1007/s10107-021-01734-y
- By:
- Publication type:
- Article
6
Algorithms for flows over time with scheduling costs.
- Published in:
- Mathematical Programming, 2022, v. 192, n. 1/2, p. 177, doi. 10.1007/s10107-021-01725-z
- By:
- Publication type:
- Article
7
Single source unsplittable flows with arc-wise lower and upper bounds.
- Published in:
- Mathematical Programming, 2022, v. 192, n. 1/2, p. 477, doi. 10.1007/s10107-021-01704-4
- By:
- Publication type:
- Article
8
About the complexity of two-stage stochastic IPs.
- Published in:
- Mathematical Programming, 2022, v. 192, n. 1/2, p. 319, doi. 10.1007/s10107-021-01698-z
- By:
- Publication type:
- Article
9
On a generalization of the Chvátal–Gomory closure.
- Published in:
- Mathematical Programming, 2022, v. 192, n. 1/2, p. 149, doi. 10.1007/s10107-021-01697-0
- By:
- Publication type:
- Article
10
On generalized surrogate duality in mixed-integer nonlinear programming.
- Published in:
- Mathematical Programming, 2022, v. 192, n. 1/2, p. 89, doi. 10.1007/s10107-021-01691-6
- By:
- Publication type:
- Article
11
Sparse graphs and an augmentation problem.
- Published in:
- Mathematical Programming, 2022, v. 192, n. 1/2, p. 119, doi. 10.1007/s10107-021-01689-0
- By:
- Publication type:
- Article
12
A fast (2+27)-approximation algorithm for capacitated cycle covering.
- Published in:
- Mathematical Programming, 2022, v. 192, n. 1/2, p. 497, doi. 10.1007/s10107-021-01678-3
- By:
- Publication type:
- Article
13
Tight approximation bounds for maximum multi-coverage.
- Published in:
- Mathematical Programming, 2022, v. 192, n. 1/2, p. 443, doi. 10.1007/s10107-021-01677-4
- By:
- Publication type:
- Article
14
Packing under convex quadratic constraints.
- Published in:
- Mathematical Programming, 2022, v. 192, n. 1/2, p. 361, doi. 10.1007/s10107-021-01675-6
- By:
- Publication type:
- Article
15
Fair colorful k-center clustering.
- Published in:
- Mathematical Programming, 2022, v. 192, n. 1/2, p. 339, doi. 10.1007/s10107-021-01674-7
- By:
- Publication type:
- Article
16
Flexible Graph Connectivity: Approximating network design problems between 1- and 2-connectivity.
- Published in:
- Mathematical Programming, 2022, v. 192, n. 1/2, p. 409, doi. 10.1007/s10107-021-01664-9
- By:
- Publication type:
- Article
17
Graph coloring with decision diagrams.
- Published in:
- Mathematical Programming, 2022, v. 192, n. 1/2, p. 631, doi. 10.1007/s10107-021-01662-x
- By:
- Publication type:
- Article
18
Weighted Triangle-free 2-matching Problem with Edge-disjoint Forbidden Triangles.
- Published in:
- Mathematical Programming, 2022, v. 192, n. 1/2, p. 675, doi. 10.1007/s10107-021-01661-y
- By:
- Publication type:
- Article
19
Popular branchings and their dual certificates.
- Published in:
- Mathematical Programming, 2022, v. 192, n. 1/2, p. 567, doi. 10.1007/s10107-021-01659-6
- By:
- Publication type:
- Article
20
Constructing lattice-free gradient polyhedra in dimension two.
- Published in:
- Mathematical Programming, 2022, v. 192, n. 1/2, p. 293, doi. 10.1007/s10107-021-01658-7
- By:
- Publication type:
- Article
21
Sparse representation of vectors in lattices and semigroups.
- Published in:
- Mathematical Programming, 2022, v. 192, n. 1/2, p. 519, doi. 10.1007/s10107-021-01657-8
- By:
- Publication type:
- Article
22
The integrality number of an integer program.
- Published in:
- Mathematical Programming, 2022, v. 192, n. 1/2, p. 271, doi. 10.1007/s10107-021-01651-0
- By:
- Publication type:
- Article
23
Continuous facility location on graphs.
- Published in:
- Mathematical Programming, 2022, v. 192, n. 1/2, p. 207, doi. 10.1007/s10107-021-01646-x
- By:
- Publication type:
- Article
24
A technique for obtaining true approximations for k-center with covering constraints.
- Published in:
- Mathematical Programming, 2022, v. 192, n. 1/2, p. 3, doi. 10.1007/s10107-021-01645-y
- By:
- Publication type:
- Article
25
Extended formulations for stable set polytopes of graphs without two disjoint odd cycles.
- Published in:
- Mathematical Programming, 2022, v. 192, n. 1/2, p. 547, doi. 10.1007/s10107-021-01635-0
- By:
- Publication type:
- Article
26
Persistency of linear programming relaxations for the stable set problem.
- Published in:
- Mathematical Programming, 2022, v. 192, n. 1/2, p. 387, doi. 10.1007/s10107-020-01600-3
- By:
- Publication type:
- Article
27
Idealness of k-wise intersecting families.
- Published in:
- Mathematical Programming, 2022, v. 192, n. 1/2, p. 29, doi. 10.1007/s10107-020-01587-x
- By:
- Publication type:
- Article