✦ LIBER ✦

A new reduction method in integer programming

✍ Scribed by Harold Greenberg

Publisher: Elsevier Science
Year: 1988
Tongue: English
Weight: 331 KB
Volume: 21
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(88)90053-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the reduction method for integer line

On the reduction method for integer linear programs, II

✍ A.A. Elimam; S.E. Elmaghraby 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 853 KB

All-integer linear programming — a new a

All-integer linear programming — a new approach via dynamic programming

✍ Leon Cooper; Mary W. Cooper 📂 Article 📅 1978 🏛 John Wiley and Sons 🌐 English ⚖ 658 KB

The discrete Ψ -transformation method in

The discrete Ψ -transformation method in integer programming

✍ D.V. Ofitserov 📂 Article 📅 1990 🏛 Elsevier Science ⚖ 679 KB

A discrete dynamic convexized method for

A discrete dynamic convexized method for nonlinear integer programming

✍ Wenxing Zhu; Hong Fan 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 820 KB

In this paper, we consider the box constrained nonlinear integer programming problem. We present an auxiliary function, which has the same discrete global minimizers as the problem. The minimization of the function using a discrete local search method can escape successfully from previously converge

Polaroids: A new tool in non-convex and

Polaroids: A new tool in non-convex and in integer programming

✍ Claude-Alain Burdet 📂 Article 📅 1973 🏛 John Wiley and Sons 🌐 English ⚖ 522 KB

New maintenance-scheduling method with p

New maintenance-scheduling method with production cost minimization via integer linear programming

✍ K.W. Edwin; F. Curtius 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 455 KB