-
1
-
-
4243112556
-
-
Technical report ORWP 93/11, Ecole Polytechnique Federale do Lausanne, Lausanne, Switzerland
-
E. AMALDI AND V. KANN, The Complexity and Approximability of Finding Maximum Feasible Subsystems of Linear Relations, Technical report ORWP 93/11, Ecole Polytechnique Federale do Lausanne, Lausanne, Switzerland, 1993.
-
(1993)
The Complexity and Approximability of Finding Maximum Feasible Subsystems of Linear Relations
-
-
Amaldi, E.1
Kann, V.2
-
2
-
-
0003878763
-
-
North-Holland, Amsterdam
-
C. BERGE, Hypergraphs, North-Holland, Amsterdam, 1989.
-
(1989)
Hypergraphs
-
-
Berge, C.1
-
3
-
-
4243190033
-
Elementary vectors and two polyhedral relaxations
-
R. G. BLAND, Elementary vectors and two polyhedral relaxations, Math. Programming Study, 8 (1978), pp. 159-166.
-
(1978)
Math. Programming Study
, vol.8
, pp. 159-166
-
-
Bland, R.G.1
-
4
-
-
0000301097
-
A greedy heuristic for the set covering problem
-
V. CHVÁTAL, A greedy heuristic for the set covering problem, Math. Oper. Res., 4 (1979), pp. 233-235.
-
(1979)
Math. Oper. Res.
, vol.4
, pp. 233-235
-
-
Chvátal, V.1
-
5
-
-
0008202973
-
Blocking polyhedra
-
B. Harris, ed., Academic Press, New York
-
D. R. FULKERSON, Blocking polyhedra, in Graph Theory and its Applications, B. Harris, ed., Academic Press, New York, 1970, pp. 93-111.
-
(1970)
Graph Theory and Its Applications
, pp. 93-111
-
-
Fulkerson, D.R.1
-
6
-
-
0001052304
-
Blocking and antiblocking pairs of polyhedra
-
_, Blocking and antiblocking pairs of polyhedra, Math. Programming, 1 (1971), pp. 168-194.
-
(1971)
Math. Programming
, vol.1
, pp. 168-194
-
-
-
8
-
-
0347278771
-
Identifying minimally inconsistent subsystems
-
J. GLEESON AND J. RYAN, Identifying minimally inconsistent subsystems, ORSA J. Comput., 2 (1990), pp. 61-67.
-
(1990)
ORSA J. Comput.
, vol.2
, pp. 61-67
-
-
Gleeson, J.1
Ryan, J.2
-
9
-
-
4243055741
-
-
Personal communication
-
W. PULLEYBLANK, Personal communication, 1988.
-
(1988)
-
-
Pulleyblank, W.1
-
10
-
-
0039178406
-
n
-
R.C. Bose and T.A. Dowling, eds., University of North Carolina Press, Chapel Hill, NC
-
n, in Combinatorial Mathematics and its Applications, R.C. Bose and T.A. Dowling, eds., University of North Carolina Press, Chapel Hill, NC, 1969, pp. 104-127.
-
(1969)
Combinatorial Mathematics and Its Applications
, pp. 104-127
-
-
Rockafellar, R.T.1
-
11
-
-
4243103574
-
Transverals of IIS-hypergraphs
-
J. RYAN, Transverals of IIS-hypergraphs, Congr. Numer., 81 (1991), pp. 17-22.
-
(1991)
Congr. Numer.
, vol.81
, pp. 17-22
-
-
Ryan, J.1
-
12
-
-
38049110306
-
A note on resolving infeasibility in linear programs by constraint relaxation
-
J. K. SANKARAN, A note on resolving infeasibility in linear programs by constraint relaxation, OR Letters, 13 (1993), pp. 19-20.
-
(1993)
OR Letters
, vol.13
, pp. 19-20
-
-
Sankaran, J.K.1
|