Chapter: Unconstrained Polynomial 0

Click here to donate your five minutes and submit the table of contents of a book.

Search from the table of contents of 2.5 million books

Advanced Search (Beta)

Home > Nonlinear Integer Programming > Unconstrained Polynomial 0–1 Optimization

Nonlinear Integer Programming |

Duan Li; Xiaoling Sun

Springer US

Unconstrained Polynomial 0–1 Optimization

Chapter Info

ARI Id

1664083770880_256425

Access

Not Available Free

Pages

293-313

DOI

10.1007/0-387-32995-1_10

Chapter URL

https://rd.springer.com/chapter/10.1007/0-387-32995-1_10

Chapters

entries per page

Filter:

Showing 0 to 0 of 0 entries

Chapter	Author(s)	Book	Book Authors	Year	Publisher
No data available in table
Chapter	Author(s)	Book	Book Authors	Year	Publisher

Showing 0 to 0 of 0 entries

Books

entries per page

Filter:

Showing 0 to 0 of 0 entries

Book	Author(s)	Year	Publisher
No data available in table
Book	Author(s)	Year	Publisher

Showing 0 to 0 of 0 entries

Books

Book	Author(s)	Year	Publisher
Book	Author(s)	Year	Publisher

Articles

entries per page

Filter:

Showing 0 to 0 of 0 entries

Article Title	Authors	Journal	Vol Info	Language
No data available in table
Article Title	Authors	Journal	Vol Info	Language

Showing 0 to 0 of 0 entries

Articles

entries per page

Filter:

Showing 0 to 0 of 0 entries

Heading	Article Title	Authors	Journal	Vol Info
No data available in table
Heading	Article Title	Authors	Journal	Vol Info

Showing 0 to 0 of 0 entries

Articles

entries per page

Filter:

Showing 0 to 0 of 0 entries

Title	Author	Supervisor	Degree	Institute
No data available in table
Title	Author	Supervisor	Degree	Institute

Showing 0 to 0 of 0 entries

Table of Contents of Book

entries per page

Filter:

Showing 1 to 16 of 16 entries

Chapters/Headings	Author(s)	Pages	Info
Front Matter		i-xxii
Introduction		1-11
Optimality, Relaxation and General Solution Procedures		13-44
Lagrangian Duality Theory		45-95
Surrogate Duality Theory		97-112
Nonlinear Lagrangian and Strong Duality		113-148
Nonlinear Knapsack Problems		149-207
Separable Integer Programming		209-239
Nonlinear Integer Programming with a Quadratic Objective Function		241-264
Nonseparable Integer Programming		265-291
Unconstrained Polynomial 0–1 Optimization		293-313
Constrained Polynomial 0–1 Programming		315-348
Two Level Methods for Constrained Polynomial 0–1 Programming		349-372
Mixed-Integer Nonlinear Programming		373-395
Global Descent Methods		397-417
Back Matter		419-437
Chapters/Headings	Author(s)	Pages	Info

Showing 1 to 16 of 16 entries

Similar Books

entries per page

Filter:

Showing 0 to 0 of 0 entries

Book	Author(s)	Year	Publisher
No data available in table
Book	Author(s)	Year	Publisher

Showing 0 to 0 of 0 entries

Similar Chapters

entries per page

Filter:

Showing 0 to 0 of 0 entries

Chapter	Author(s)	Book	Book Authors	Year	Publisher
No data available in table
Chapter	Author(s)	Book	Book Authors	Year	Publisher

Showing 0 to 0 of 0 entries

Similar Thesis

entries per page

Filter:

Showing 0 to 0 of 0 entries

Title	Author	Supervisor	Degree	Institute
No data available in table
Title	Author	Supervisor	Degree	Institute

Showing 0 to 0 of 0 entries

Similar News

entries per page

Filter:

Showing 0 to 0 of 0 entries

Headline	Date	News Paper	Country
No data available in table
Headline	Date	News Paper	Country

Showing 0 to 0 of 0 entries