Library Catalog
Amazon cover image
Image from Amazon.com

Optimization : A Journal of Mathematical Programming and Operations Research. Volume 19, Number 6.

Contributor(s): Material type: TextTextSeries: Optimization ; Volume 19, Number 6Publisher: Berlin ; Boston : De Gruyter, [2022]Copyright date: ©1988Edition: Reprint 2021Description: 1 online resource (160 p.)Content type:
Media type:
Carrier type:
ISBN:
  • 9783112567357
  • 9783112567364
Subject(s): Other classification:
  • online - DeGruyter
Online resources: Available additional physical forms:
  • Issued also in print.
Contents:
Frontmatter -- Contents of Volume 19 (1988) -- A Covering Theorem for Set-Valued Mappings -- A Continuous Set Covering Problem as a Quasidifferentiable Optimization Problem -- A Cutting-Plane Method for Quadratic Semi-Infinite Programming Problems -- A Global Convergence Theorem for Aggregation Algorithms -- An Exact Penalty Approach for Solving a Class of Minimization Problems with Boolean Variables -- A New Algorithm for the Solution of the Linear Minimax Approximation Problem -- Thickness Optimization Problem -- An Enumeration Algorithm for Combinatorial Problems of the Reliability Analysis of Binary Coherent Systems -- Improved Lower and Upper Bounds for the Number of Feasible Solutions to a Knapsack Problem -- Über ein Vektoroptimierungsproblem für endliche stochastische zellulare Systeme
Holdings
Item type Current library Call number URL Status Notes Barcode
eBook eBook Biblioteca "Angelicum" Pont. Univ. S.Tommaso d'Aquino Nuvola online online - DeGruyter (Browse shelf(Opens below)) Online access Not for loan (Accesso limitato) Accesso per gli utenti autorizzati / Access for authorized users (dgr)9783112567364

Frontmatter -- Contents of Volume 19 (1988) -- A Covering Theorem for Set-Valued Mappings -- A Continuous Set Covering Problem as a Quasidifferentiable Optimization Problem -- A Cutting-Plane Method for Quadratic Semi-Infinite Programming Problems -- A Global Convergence Theorem for Aggregation Algorithms -- An Exact Penalty Approach for Solving a Class of Minimization Problems with Boolean Variables -- A New Algorithm for the Solution of the Linear Minimax Approximation Problem -- Thickness Optimization Problem -- An Enumeration Algorithm for Combinatorial Problems of the Reliability Analysis of Binary Coherent Systems -- Improved Lower and Upper Bounds for the Number of Feasible Solutions to a Knapsack Problem -- Über ein Vektoroptimierungsproblem für endliche stochastische zellulare Systeme

restricted access online access with authorization star

http://purl.org/coar/access_right/c_16ec

Issued also in print.

Mode of access: Internet via World Wide Web.

In English.

Description based on online resource; title from PDF title page (publisher's Web site, viewed 01. Dez 2022)