A linear integer programming bound for maximum-entropy sampling.
- Published in:
- Mathematical Programming, 2003, v. 94, n. 2/3, p. 247, doi. 10.1007/s10107-002-0318-x
- By:
- Publication type:
- Article
Works matching IS 00255610 AND DT 2003 AND VI 94 AND IP 2/3
Results: 15
1
2
Integral decomposition of polyhedra and someapplications in mixed integer programming.
- Published in:
- Mathematical Programming, 2003, v. 94, n. 2/3, p. 193, doi. 10.1007/s10107-002-0315-0
- By:
- Publication type:
- Article
3
Small covering designs by branch-and-cut.
- Published in:
- Mathematical Programming, 2003, v. 94, n. 2/3, p. 207, doi. 10.1007/s10107-002-0316-z
- By:
- Publication type:
- Article
4
A precise correspondence between lift-and-project cuts, simple disjunctive cuts, and mixed integer gomory cuts for 0-1 programming.
- Published in:
- Mathematical Programming, 2003, v. 94, n. 2/3, p. 221, doi. 10.1007/s10107-002-0317-y
- By:
- Publication type:
- Article
5
The Aussois 2000 workshop in combinatorial optimization introduction.
- Published in:
- Mathematical Programming, 2003, v. 94, n. 2/3, p. 189, doi. 10.1007/s10107-002-0314-1
- By:
- Publication type:
- Article
6
Integer linear programming models for 2-staged two-dimensional Knapsack problems.
- Published in:
- Mathematical Programming, 2003, v. 94, n. 2/3, p. 257, doi. 10.1007/s10107-002-0319-9
- By:
- Publication type:
- Article
7
On the separation of split cuts and related inequalities.
- Published in:
- Mathematical Programming, 2003, v. 94, n. 2/3, p. 279, doi. 10.1007/s10107-002-0320-3
- By:
- Publication type:
- Article
8
Easy and difficult objective functions for max cut.
- Published in:
- Mathematical Programming, 2003, v. 94, n. 2/3, p. 459, doi. 10.1007/s10107-002-0328-8
- By:
- Publication type:
- Article
9
The merchant subtour problem.
- Published in:
- Mathematical Programming, 2003, v. 94, n. 2/3, p. 295, doi. 10.1007/s10107-002-0321-2
- By:
- Publication type:
- Article
10
Decomposition of test sets in stochastic integer programming.
- Published in:
- Mathematical Programming, 2003, v. 94, n. 2/3, p. 323, doi. 10.1007/s10107-002-0322-1
- By:
- Publication type:
- Article
11
On the capacitated vehicle routing problem.
- Published in:
- Mathematical Programming, 2003, v. 94, n. 2/3, p. 343, doi. 10.1007/s10107-002-0323-0
- By:
- Publication type:
- Article
12
Preemptive scheduling with rejection.
- Published in:
- Mathematical Programming, 2003, v. 94, n. 2/3, p. 361, doi. 10.1007/s10107-002-0324-z
- By:
- Publication type:
- Article
13
On the polyhedral structure of a multi–item production planning model with setup times.
- Published in:
- Mathematical Programming, 2003, v. 94, n. 2/3, p. 375, doi. 10.1007/s10107-002-0325-y
- By:
- Publication type:
- Article
14
Rectilinear group Steiner trees and applications in VLSI design.
- Published in:
- Mathematical Programming, 2003, v. 94, n. 2/3, p. 407, doi. 10.1007/s10107-002-0326-x
- By:
- Publication type:
- Article
15
Optimal labeling of point features in rectangular labeling models.
- Published in:
- Mathematical Programming, 2003, v. 94, n. 2/3, p. 435, doi. 10.1007/s10107-002-0327-9
- By:
- Publication type:
- Article