✦ LIBER ✦

A New Slant on the “Biggest Box” Maximum-Minimum Problem

✍ Scribed by Alfred D. Garvin

Book ID: 114975830
Publisher: School Science and Mathematics Association
Year: 1977
Tongue: English
Weight: 173 KB
Volume: 77
Category: Article
ISSN: 0036-6803
DOI: 10.1111/j.1949-8594.1977.tb09385.x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the minimum and maximum averaged resi

On the minimum and maximum averaged resistance problem of moving bodies

✍ A. Yu. Plakhov 📂 Article 📅 2007 🏛 Springer US 🌐 English ⚖ 141 KB

New algorithms for the weighted maximum

New algorithms for the weighted maximum cut problem on graphs

✍ N. Z. Shor; O. A. Berezovskii 📂 Article 📅 1995 🏛 Springer US 🌐 English ⚖ 360 KB

A note on the single-machine scheduling

A note on the single-machine scheduling problem with minimum weighted completion time and maximum allowable tardiness

✍ Suresh Chand; Hans Schneeberger 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 328 KB

This paper analyzes the Smith-heuristic for the single-machine scheduling problem where the objective is to minimize the total weighted completion time subject to the constraint that the tardiness for any job does not exceed a prespecified maximum allowable tardiness. We identify several cases of th

On the Validity of the Maximum Principle

On the Validity of the Maximum Principle and of the Euler--Lagrange Equation for a Minimum Problem Depending on the Gradient

✍ Cellina, Arrigo; Perrotta, Stefania 📂 Article 📅 1998 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 328 KB

A new fast algorithm for solving the min

A new fast algorithm for solving the minimum spanning tree problem based on DNA molecules computation

✍ Wang, Zhaocai; Huang, Dongmei; Meng, Huajun; Tang, Chengpei 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 558 KB