kw.\*:("Programmation en nombres entiers")
Results 1 to 25 of 2551
Selection :
A doubly cyclic channel assignment problemMCDIARMID, C.Discrete applied mathematics. 1997, Vol 80, Num 2-3, pp 263-268, issn 0166-218XArticle
Watermarking integer linear programming solutionsMEGERIAN, Seapahn; DRINIC, Milenko; POTKONJAK, Miodrag et al.Design automation conference. 2002, pp 8-13, isbn 1-58113-461-4, 6 p.Conference Paper
A simplicial approach to the determination of an integer point of a simplexDANG, C; VAN MAAREN, H.Mathematics of operations research. 1998, Vol 23, Num 2, pp 403-415, issn 0364-765XArticle
Comment on : Logical representation of integer programming models. Authors' replyVETSCHERA, R; KUHN YEOM; JAE KYU LEE et al.Decision support systems. 1998, Vol 22, Num 4, pp 391-393, issn 0167-9236Article
Task scheduling and voltage selection for energy minimizationZHANA, Yumin; HU, Xiaobo; CHEN, Danny Z et al.Design automation conference. 2002, pp 183-188, isbn 1-58113-461-4, 6 p.Conference Paper
Integer programming formulations of statistical classification problemsWILSON, J. M.Omega (Oxford). 1996, Vol 24, Num 6, pp 681-688, issn 0305-0483Article
Optimization of machining process plan for planar surfacesLINN, R. J; SUKANTA MISHRA.IIE transactions. 1995, Vol 27, Num 4, pp 427-434, issn 0740-817XArticle
Subadditive approaches in integer programmingKLABJAN, Diego.European journal of operational research. 2007, Vol 183, Num 2, pp 525-545, issn 0377-2217, 21 p.Article
Minimal load constrained vehicle routing problemsKARA, Imdat; BEKTAS, Tolga.Lecture notes in computer science. 2005, pp 188-195, issn 0302-9743, isbn 3-540-26032-3, 3Vol, 8 p.Conference Paper
The grid packing problem : selecting a harvesting pattern in an area with forbidden regionsSNYDER, S; REVELLE, C.Forest science. 1996, Vol 42, Num 1, pp 27-34, issn 0015-749XArticle
Assignment problems : A golden anniversary surveyPENTICO, David W.European journal of operational research. 2007, Vol 176, Num 2, pp 774-793, issn 0377-2217, 20 p.Article
A new integer programming formulation for the pure parsimony problem in haplotype analysisBROWN, Daniel G; HARROWER, Ian M.Lecture notes in computer science. 2004, pp 254-265, issn 0302-9743, isbn 3-540-23018-1, 12 p.Conference Paper
A routing algorithm for a single straddle carrier to load export containers onto a containershipKI YOUNG KIM; KAP HWAN KIM.International journal of production economics. 1999, Vol 59, Num 1-3, pp 425-433, issn 0925-5273Conference Paper
Power system restoration by joint usage of expert system and mathematical programming approachNAGATA, T; SAKAKI, H; KITAGAWA, M et al.Electrical engineering in Japan. 1996, Vol 117, Num 2, pp 41-54, issn 0424-7760Article
A hybrid heuristic for the generalized assignment problemAMINI, M. M; RACER, M.European journal of operational research. 1995, Vol 87, Num 2, pp 343-348, issn 0377-2217Article
On the existence of duality gaps for mixed integer programmingTANAKA, Yoshihiro.International journal of systems science. 2005, Vol 36, Num 6, pp 375-379, issn 0020-7721, 5 p.Article
An integer linear programming based approach for parallelizing applications in on-chip multiprocessorsKADAYIF, I; KANDEMIR, M; SEZER, U et al.Design automation conference. 2002, pp 697-702, isbn 1-58113-461-4, 6 p.Conference Paper
Unidimensional scaling : A linear programming approach minimizing absolute deviationsSIMANTIRAKI, E.Journal of classification. 1996, Vol 13, Num 1, pp 19-25, issn 0176-4268Article
Optimal robotic component placementBROAD, K; MASON, A; RÖNNQVIST, M et al.The Journal of the Operational Research Society. 1996, Vol 47, Num 11, pp 1343-1354, issn 0160-5682Article
Power system restoration by joint usage of expert system and mathematical programming approachNAGATA, T; SASAKI, H; YOKOYAMA, R et al.IEEE transactions on power systems. 1995, Vol 10, Num 3, pp 1473-1479, issn 0885-8950Article
An Effective Algorithm for Routing with Node Inclusion ConstraintJIAN WU; SHENG WANG; HONGFANG YU et al.Proceedings of SPIE, the International Society for Optical Engineering. 2008, Vol 7137, issn 0277-786X, isbn 9780819473776, 71372N.1-71372N.8, 2Conference Paper
Approximate min-max relations for odd cycles in planar graphsFIORINI, Samuel; HARDY, Nadia; REED, Bruce et al.Lecture notes in computer science. 2005, pp 35-50, issn 0302-9743, isbn 3-540-26199-0, 16 p.Conference Paper
A sparse solution to the bounded subset selection problem : A network flow model approachALGHONIEMY, Masoud; TEWFIK, Ahmed H.ICASSP. 2004, isbn 0-7803-8484-9, vol V, 89-92Conference Paper
On generating all minimal integer solutions for a monotone system of linear inequalitiesBOROS, E; ELBASSIONI, K; GURVICH, V et al.Lecture notes in computer science. 2001, pp 92-103, issn 0302-9743, isbn 3-540-42287-0Conference Paper
High-level modelling and reformulation of constraint satisfaction problemsHNICH, Brahim.Lecture notes in computer science. 2001, issn 0302-9743, isbn 3-540-42863-1, p. 766Conference Paper