No label defined (Q4955990)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1450273
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 1450273 |
Statements
22 May 2000
0 references
cutting plane
0 references
integer linear programming
0 references
combinatorial optimization
0 references
0.7828683257102966
0 references
0.740807831287384
0 references
0.7344755530357361
0 references
The following problem is dealt with: \[ \sum c_{j}x_{j}\rightarrow \max ,\;\text{subject to}\sum a_{ij}x_{j}\leq b_{i},\;i=1,2,\dots,m,\;x\in E, \] where \(E\subset E_{n}\) is an Euclidean combinatorial set. The proposed method is based on the cutting plane method.
0 references
