Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Programmacion cero uno")

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 264

  • Page / 11
Export

Selection :

  • and

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

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

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 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

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

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 mathematical formulation and complexity considerations for the blocks relocation problemCASERTA, Marco; SCHWARZE, Silvia; VOSS, Stefan et al.European journal of operational research. 2012, Vol 219, Num 1, pp 96-104, issn 0377-2217, 9 p.Article

Improved core problem based heuristics for the 0/1 multi-dimensional knapsack problemDELLA CROCE, F; GROSSO, A.Computers & operations research. 2012, Vol 39, Num 1, pp 27-31, issn 0305-0548, 5 p.Article

In Vitro Fertilization Genetic Algorithm Applied To Multidimensional 0-1 Knapsack ProblemCAMILO-JUNIOR, Celso G; YAMANAKA, Keiji.Artificial intelligence. International conferenceWorldComp'2011. 2011, pp 928-933, isbn 1-60132-183-X 1-60132-184-8 1-60132-185-6, 6 p.Conference Paper

Staff rostering for the station personnel of a railway companyLEZAUN, M; PEREZ, G; SAINZ DE LA MAZA, E et al.The Journal of the Operational Research Society. 2010, Vol 61, Num 7, pp 1104-1111, issn 0160-5682, 8 p.Article

Heuristics for the 0―1 multidimensional knapsack problem : Cooperative combinatorial optimizationBOYER, V; ELKIHEL, M; EL BAZ, D et al.European journal of operational research. 2009, Vol 199, Num 3, pp 658-664, issn 0377-2217, 7 p.Article

Minimizing earliness and tardiness subject to total completion time in an identical parallel machine systemSU, Ling-Huey.Computers & operations research. 2009, Vol 36, Num 2, pp 461-471, issn 0305-0548, 11 p.Article

Exploiting equalities in polynomial programmingPENA, Javier F; VERA, Juan C; ZULUAGA, Luis F et al.Operations research letters. 2008, Vol 36, Num 2, pp 223-228, issn 0167-6377, 6 p.Article

Relationships between Pareto optimality in multi-objective 0-1 linear programming and DEA efficiencyYOUGBARE, Jacob W; TEGHEM, Jacques.European journal of operational research. 2007, Vol 183, Num 2, pp 608-617, issn 0377-2217, 10 p.Article

Project prioritization under policy restrictions. A combination of MCDA with 0-1 programmingMAVROTAS, G; DIAKOULAKI, D; CALOGHIROU, Y et al.European journal of operational research. 2006, Vol 171, Num 1, pp 296-308, issn 0377-2217, 13 p.Article

Relaxations of linear programming problems with first order stochastic dominance constraintsNOYAN, Nilay; RUDOLF, Gabor; RUSZCZYNSKI, Andrzej et al.Operations research letters. 2006, Vol 34, Num 6, pp 653-659, issn 0167-6377, 7 p.Article

Strong formulations of robust mixed 0-1 programmingATAMTÜRK, Alper.Mathematical programming. 2006, Vol 108, Num 2-3, pp 235-250, issn 0025-5610, 16 p.Article

A heuristic algorithm for the truckload and less-than-truckload problemCHU, Ching-Wu.European journal of operational research. 2005, Vol 165, Num 3, pp 657-667, issn 0377-2217, 11 p.Article

An algorithm for multiparametric min max 0-1-integer programming problems relative to the objective functionQUINTERO, José Luis; CREMA, Alejandro.RAIRO. Recherche opérationnelle. 2005, Vol 39, Num 4, pp 243-252, issn 0399-0559, 10 p.Article

  • Page / 11