A branch and bound algorithm for solving a class of nonlinear integer programming problems (Q3757685): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/nav.3800330403 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2084927502 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An algorithm (GIPC2) for solving integer programming problems with separable nonlinear objective functions / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 20:04, 17 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A branch and bound algorithm for solving a class of nonlinear integer programming problems |
scientific article |
Statements
A branch and bound algorithm for solving a class of nonlinear integer programming problems (English)
0 references
1986
0 references
concave functions
0 references
separable objective function
0 references
nonlinear integer programming
0 references
branch and bound
0 references
continuous linear subproblems
0 references
penalties
0 references
