Normal view MARC view ISBD view

Algorithms and relaxations for optimization over bilinear covering sets (R)

Rahman, Hamidur

Algorithms and relaxations for optimization over bilinear covering sets (R) - Mumbai IIT 2019 - xi,130 p. 30 cm

Thesis

Subjects--Topical Terms:
Theses and Dissertations
Mathematical optimization
Production planning--Mathematical models
Feasibility studies
Nonlinear programming
Nonconvex programming

Universal Decimal Class. No.: 043:658.5:519.28 / Rah

Print
Add to your cart (remove)
More searches

Search for this title in:
Other Libraries (WorldCat) Other Databases (Google Scholar) Online Stores (Bookfinder.com) Open Library (openlibrary.org)