Works matching IS 00255610 AND DT 2003 AND VI 98 AND IP 1-3

Results: 23

Asymptotic scheduling.

Published in:

Mathematical Programming, 2003, v. 98, n. 1-3, p. 431, doi. 10.1007/s10107-003-0412-8

By:

Serafini, Paolo

Publication type:

Article

Max algebra and the linear assignment problem.

Published in:

Mathematical Programming, 2003, v. 98, n. 1-3, p. 415, doi. 10.1007/s10107-003-0411-9

By:

Burkard, Rainer E.;
Butkovic, Peter

Publication type:

Article

Approximation algorithms for the test cover problem.

Published in:

Mathematical Programming, 2003, v. 98, n. 1-3, p. 477, doi. 10.1007/s10107-003-0414-6

By:

De Bontridder, K. M. J.;
Halldórsson, B. V.;
Halldórsson, M. M.;
Hurkens, C. A. J.;
Lenstra, J. K.;
Ravi, R.;
Stougie, L.

Publication type:

Article

Models and algorithms for a staff scheduling problem.

Published in:

Mathematical Programming, 2003, v. 98, n. 1-3, p. 445, doi. 10.1007/s10107-003-0413-7

By:

Caprara, Alberto;
Monaci, Michele;
Toth, Paolo

Publication type:

Article

The design of corporate tax structures.

Published in:

Mathematical Programming, 2003, v. 98, n. 1-3, p. 493, doi. 10.1007/s10107-003-0416-4

By:

Christofides, Simon;
Christofides, Alexander;
Christofides, Nicos

Publication type:

Article

The clustering matroid and the optimal clustering tree.

Published in:

Mathematical Programming, 2003, v. 98, n. 1-3, p. 385, doi. 10.1007/s10107-003-0410-x

By:

Korach, Ephraim;
Stern, Michal

Publication type:

Article

Detecting symmetries by branch &cut.

Published in:

Mathematical Programming, 2003, v. 98, n. 1-3, p. 369, doi. 10.1007/s10107-003-0409-3

By:

Buchheim, Christoph;
Jünger, Michael

Publication type:

Article

Extending the Balas-Yu bounds on the number of maximal independent sets in graphs to hypergraphs and lattices.

Published in:

Mathematical Programming, 2003, v. 98, n. 1-3, p. 355, doi. 10.1007/s10107-003-0408-4

By:

Boros, Endre;
Elbassioni, Khaled;
Gurvich, Vladimir;
Khachiyan, Leonid

Publication type:

Article

Binary clutter inequalities for integer programs.

Published in:

Mathematical Programming, 2003, v. 98, n. 1-3, p. 201, doi. 10.1007/s10107-003-0402-x

By:

Letchford, Adam N.

Publication type:

Article

Facets of the independent set polytope.

Published in:

Mathematical Programming, 2003, v. 98, n. 1-3, p. 177, doi. 10.1007/s10107-003-0401-y

By:

Easton, Todd;
Hooker, Kevin;
Lee, Eva K.

Publication type:

Article

Lift-and-project cuts and perfect graphs.

Published in:

Mathematical Programming, 2003, v. 98, n. 1-3, p. 309, doi. 10.1007/s10107-003-0406-6

By:

Sebastián, Ceria

Publication type:

Article

The domino inequalities: facets for the symmetric traveling salesman polytope.

Published in:

Mathematical Programming, 2003, v. 98, n. 1-3, p. 223, doi. 10.1007/s10107-003-0403-9

By:

Naddef, Denis;
Wild, Emmanuel

Publication type:

Article

The stable set problem and the lift-and-project ranks of graphs.

Published in:

Mathematical Programming, 2003, v. 98, n. 1-3, p. 319, doi. 10.1007/s10107-003-0407-5

By:

Lipták, László;
Tunçel, Levent

Publication type:

Article

On the facets of the mixed--integer knapsack polyhedron.

Published in:

Mathematical Programming, 2003, v. 98, n. 1-3, p. 145, doi. 10.1007/s10107-003-0400-z

By:

Atamtürk, Alper

Publication type:

Article

An algorithm for mixed integer optimization.

Published in:

Mathematical Programming, 2003, v. 98, n. 1-3, p. 281, doi. 10.1007/s10107-003-0405-7

By:

Köppe, Matthias;
Weismantel, Robert

Publication type:

Article

Parallel branch, cut, and price for large-scale discrete optimization.

Published in:

Mathematical Programming, 2003, v. 98, n. 1-3, p. 253, doi. 10.1007/s10107-003-0404-8

By:

Ralphs, T. K.;
Ladányi, L.;
Saltzman, M. J.

Publication type:

Article

Lifted inequalities for 0-1 mixed integer programming: Basic theory and algorithms.

Published in:

Mathematical Programming, 2003, v. 98, n. 1-3, p. 89, doi. 10.1007/s10107-003-0398-2

By:

Richard, J. -P. P.;
De Farias Jr., I. R.;
Nemhause, G. L.

Publication type:

Article

Robust discrete optimization and network flows.

Published in:

Mathematical Programming, 2003, v. 98, n. 1-3, p. 49, doi. 10.1007/s10107-003-0396-4

By:

Bertsimas, Dimitris;
Sim, Melvyn

Publication type:

Article

Lifted inequalities for 0-1 mixed integer programming: Superlinear lifting.

Published in:

Mathematical Programming, 2003, v. 98, n. 1-3, p. 115, doi. 10.1007/s10107-003-0399-1

By:

Richard, J.-P. P.;
De Farias Jr., I. R.;
Nemhauser, G. L.

Publication type:

Article

Tight formulations for some simple mixed integer programs and convex objective integer programs.

Published in:

Mathematical Programming, 2003, v. 98, n. 1-3, p. 73, doi. 10.1007/s10107-003-0397-3

By:

Miller, Andrew J.;
Wolsey, Laurence A.

Publication type:

Article

Local branching.

Published in:

Mathematical Programming, 2003, v. 98, n. 1-3, p. 23, doi. 10.1007/s10107-003-0395-5

By:

Fischetti, Matteo;
Lodi, Andrea

Publication type:

Article

Exploiting orbits in symmetric ILP.

Published in:

Mathematical Programming, 2003, v. 98, n. 1-3, p. 3, doi. 10.1007/s10107-003-0394-6

By:

Margot, François

Publication type:

Article

Integer programming.

Published in:

Mathematical Programming, 2003, v. 98, n. 1-3, p. 1, doi. 10.1007/s10107-003-0417-3

By:

Cornuéjols, Gérard;
Pulleyblank, William R.

Publication type:

Article