Image from Google Jackets
Image from OpenLibrary

Advances and Novel Approaches in Discrete Optimization

Contributor(s): Material type: TextTextPublication details: Basel, Switzerland MDPI - Multidisciplinary Digital Publishing Institute 2020Description: 1 electronic resource (354 p.)ISBN:
  • 9783039432226
Subject(s): Online resources: Summary: Discrete optimization is an important area of Applied Mathematics with a broad spectrum of applications in many fields. This book results from a Special Issue in the journal Mathematics entitled 'Advances and Novel Approaches in Discrete Optimization'. It contains 17 articles covering a broad spectrum of subjects which have been selected from 43 submitted papers after a thorough refereeing process. Among other topics, it includes seven articles dealing with scheduling problems, e.g., online scheduling, batching, dual and inverse scheduling problems, or uncertain scheduling problems. Other subjects are graphs and applications, evacuation planning, the max-cut problem, capacitated lot-sizing, and packing algorithms.
List(s) this item appears in: E-Books from Directory of Open Access Books
Tags from this library: No tags from this library for this title.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Item type Current library Call number Status Date due Barcode
E-Book E-Book Directory of Open Access Books Not For Loan

Open Access

Discrete optimization is an important area of Applied Mathematics with a broad spectrum of applications in many fields. This book results from a Special Issue in the journal Mathematics entitled 'Advances and Novel Approaches in Discrete Optimization'. It contains 17 articles covering a broad spectrum of subjects which have been selected from 43 submitted papers after a thorough refereeing process. Among other topics, it includes seven articles dealing with scheduling problems, e.g., online scheduling, batching, dual and inverse scheduling problems, or uncertain scheduling problems. Other subjects are graphs and applications, evacuation planning, the max-cut problem, capacitated lot-sizing, and packing algorithms.

Creative Commons

There are no comments on this title.

to post a comment.

University of Rizal System
Email us at univlibservices@urs.edu.ph

Visit our Website www.urs.edu.ph/library

Powered by Koha