Improved sorting-based procedure for integer programmingDANTCHEV, Stefan.Mathematical programming. 2002, Vol 92, Num 2, pp 297-300, issn 0025-5610Article

Primal separation for 0/1 polytopesEISENBRAND, Friedrich; RINALDI, Giovanni; VENTURA, Paolo et al.Mathematical programming. 2003, Vol 95, Num 3, pp 475-491, issn 0025-5610, 17 p.Article

Approximate fixed-rank closures of covering problemsBIENSTOCK, Daniel; ZUCKERBERG, Mark.Mathematical programming. 2006, Vol 105, Num 1, pp 9-27, issn 0025-5610, 19 p.Article

Logic-based Benders decompositionHOOKER, J. N; OTTOSSON, G.Mathematical programming. 2003, Vol 96, Num 1, pp 33-60, issn 0025-5610, 28 p.Article

Linear forms of nonlinear expressions: New insights on old ideasADAMS, Warren P; FORRESTER, Richard J.Operations research letters. 2007, Vol 35, Num 4, pp 510-518, issn 0167-6377, 9 p.Article

On complexity of unconstrained hyperbolic 0-1 programming problemsPROKOPYEV, Oleg A; HUANG, Hong-Xuan; PARDALOS, Panos M et al.Operations research letters. 2005, Vol 33, Num 3, pp 312-318, issn 0167-6377, 7 p.Article

Lift-and-project for Mixed 0-1 programming: recent progressBALAS, Egon; PERREGAARD, Michael.Discrete applied mathematics. 2002, Vol 123, Num 1-3, pp 129-154, issn 0166-218XConference Paper

Special Issue on Combinatorial Optimization and Data Mining in BiomedicinePARDALOS, Panos M.Journal of combinatorial optimization. 2006, Vol 10, Num 1, issn 1382-6905, 89 p.Conference Proceedings

On the rank of mixed 0,1 polyhedraCORNUEJOLS, Gérard; YANJUN LI.Mathematical programming. 2002, Vol 91, Num 2, pp 391-397, issn 0025-5610Article

Integer programming and combinatorial optimization (Cambridge MA, 27-29 May 2002)Cook, William J; Schultz, Andreas S.Lecture notes in computer science. 2002, issn 0302-9743, isbn 3-540-43676-6, XI, 486 p, isbn 3-540-43676-6Conference Proceedings

A two-phase linear programming approach for redundancy allocation problemsHSIEH, Yi-Chih.Yugoslav journal of operations research. 2002, Vol 12, Num 2, pp 227-236, issn 0354-0243, 10 p.Article

A dual graph translation of a problem in 'life'SMITH, Barbara M.Lecture notes in computer science. 2002, pp 402-414, issn 0302-9743, isbn 3-540-44120-4, 13 p.Conference Paper

On characterizing tighter formulations for 0-1 programsESCUDERO, L. F; MUNOZ, S.European journal of operational research. 1998, Vol 106, Num 1, pp 172-176, issn 0377-2217Article

A comparison of the Sherali-Adams, Lovász-Schrijver and Lasserre relaxations for 0 - 1 programmingLAURENT, Monique.Report - Probability, networks and algorithms. 2001, Num 8, pp 1-26, issn 1386-3711Article

An exact algorithm for the 0-1 collapsing knapsack problemFAYARD, D; PLATEAU, G.Discrete applied mathematics. 1994, Vol 49, Num 1-3, pp 175-187, issn 0166-218XArticle

Solving zero-one mixed integer programming problems using tabu searchLØKKETANGEN, A; GLOVER, F.European journal of operational research. 1998, Vol 106, Num 2-3, pp 624-658, issn 0377-2217Article

A quick and effective method for capacitated lot sizing with startup and reservation costsCOLEMAN, B. J; MCKNEW, M. A.Computers & operations research. 1995, Vol 22, Num 6, pp 641-653, issn 0305-0548Article

On the Dietrich-Escudero approach for solving the 0-1 knapsack problem with a 0-1 objective functionESCUDERO, L. F; PEREZ, G; GARIN, A et al.European journal of operational research. 1994, Vol 73, Num 1, pp 167-168, issn 0377-2217Article

A hierarchy of relaxations between the continuous and convex hull representation for zero-one programming problemsSHERALI, H. D; ADAMS, W. P.SIAM journal on discrete mathematics (Print). 1990, Vol 3, Num 3, pp 411-430, issn 0895-4801Article

Zero crossover : A FORTRAN program to determine the dip end extent of a geological boundary using horizontal derivatives of upward-continued gravity dataMCGRATH, P.H.Computers & geosciences. 1991, Vol 17, Num 7, pp 1017-1031, issn 0098-3004Article

New class of 0-1 integer programs with tight approximation via linear relaxationsASRATIAN, A. S; KUZJURIN, N. N.Mathematical methods of operations research (Heidelberg). 2001, Vol 53, Num 3, pp 363-370, issn 1432-2994Article

Simulated annealing for the unconstrained quadratic pseudo-boolean functionALKHAMIS, T. M; HASAN, M; AHMED, M. A et al.European journal of operational research. 1998, Vol 108, Num 3, pp 641-652, issn 0377-2217Article

Minimization of the 0-1 linear programming problem under linear constraints by using neural networks : Synthesis and analysisAOURID, M; KAMINSKA, B.IEEE transactions on circuits and systems. 1, Fundamental theory and applications. 1996, Vol 43, Num 5, pp 421-425, issn 1057-7122Article

A computational note on the Martello-Toth knapsack algorithmVASKO, F. J.European journal of operational research. 1994, Vol 73, Num 1, pp 169-171, issn 0377-2217Article

Partial cover and complete cover inequalitiesFERNANDEZ, E; JORNSTEN, K.Operations research letters. 1994, Vol 15, Num 1, pp 19-33, issn 0167-6377Article