Skip to main content

Nonlinear Combinatorial Optimization

  • Book
  • © 2019

Overview

  • Broadens understanding of nonlinear combinatorial optimization applications to machine learning, social computing, cloud computing, wireless communication, and data science
  • Features articles by leading experts in nonlinear combinatorial optimization
  • Outlines theoretical developments which utilize Newton methods submodular optimization, and non-submodular maximization

Part of the book series: Springer Optimization and Its Applications (SOIA, volume 147)

This is a preview of subscription content, log in via an institution to check access.

Access this book

eBook USD 39.99 USD 79.99
50% discount Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 49.99 USD 99.99
50% discount Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book USD 69.99 USD 129.99
46% discount Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (16 chapters)

Keywords

About this book

Graduate students and researchers in applied mathematics, optimization, engineering,  computer science, and  management science will find this book a useful reference which provides an introduction to applications and fundamental theories in nonlinear combinatorial optimization. Nonlinear combinatorial optimization is a new research area within combinatorial optimization and includes numerous applications to technological developments, such as wireless communication, cloud computing, data science, and social networks. Theoretical developments including discrete Newton methods, primal-dual methods with convex relaxation, submodular optimization, discrete DC program, along with several applications are discussed and explored in this book through articles by leading experts. 

Reviews

“Each chapter can be read by its own and does not assume knowledge from one of the other chapters. … All in all, the book ‘Nonlinear combinatorial optimization’ introduces some interesting topics in this relatively new field.” (Isabel Beckenbach, zbMATH 1480.90209, 2022)

Editors and Affiliations

  • Department of Computer Science, The University of Texas at Dallas, Richardson, USA

    Ding-Zhu Du

  • Department of Industrial & Systems Engineering, University of Florida, Gainesville, USA

    Panos M. Pardalos

  • Department of Computer Science, Zhejiang Normal University, Jinhua, China

    Zhao Zhang

About the editors





Bibliographic Information

Publish with us