✦ LIBER ✦

New Implicit Enumeration Method for Polynomial 0-1 Programming

✍ Scribed by Jun WANG; Duan LI

Publisher: Elsevier
Year: 2007
Weight: 126 KB
Volume: 27
Category: Article
ISSN: 1874-8651
DOI: 10.1016/s1874-8651(08)60021-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Linear 0–1 programming: A comparison of

Linear 0–1 programming: A comparison of implicit enumeration algorithms

✍ Subhash C. Narula; Joseph R. Kindorf 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 453 KB

A new global approach for 0–1 polynomial

A new global approach for 0–1 polynomial programs

✍ Li Han-Lin 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 712 KB

A new 0–1 integer programming method of

A new 0–1 integer programming method of feeder reconfiguration for loss minimization in distribution systems

✍ N.D.R. Sarma; K.S. Prakasa Rao 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 592 KB

A new linearization technique for multi-

A new linearization technique for multi-quadratic 0–1 programming problems

✍ Wanpracha Chaovalitwongse; Panos M Pardalos; Oleg A Prokopyev 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 205 KB

We consider the reduction of multi-quadratic 0-1 programming problems to linear mixed 0-1 programming problems. In this reduction, the number of additional continuous variables is O(kn) (n is the number of initial 0-1 variables and k is the number of quadratic constraints). The number of 0-1 variabl

A method for interval 0–1 nonlinear prog

A method for interval 0–1 nonlinear programming problem using a genetic algorithm

✍ Takao Yokota; Mitsuo Gen; Takeaki Taguchi; Yinxiu Li 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 356 KB

95/06117 A new 0–1 integer programming m

95/06117 A new 0–1 integer programming method of feeder reconfiguration for loss minimization in distribution systems

📂 Article 📅 1995 🏛 Elsevier Science ⚖ 211 KB