Potential reduction algorithms for structured combinatorial optimization problems (Q1373458): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q4347846 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4692656 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Duallity and sensitivity in nonconvex quadratic optimization over an ellipsoid / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Computational experience with an interior point algorithm on the satisfiability problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5202849 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An interior point algorithm to solve computationally difficult set covering problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Newton’s Method with a Model Trust Region Modification / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A nonlinear approach to a class of combinatorial optimization problems / rank | |||
Normal rank | |||
Revision as of 19:15, 27 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Potential reduction algorithms for structured combinatorial optimization problems |
scientific article |
Statements
Potential reduction algorithms for structured combinatorial optimization problems (English)
0 references
16 August 1998
0 references
interior point methods
0 references
binary programming
0 references
potential reduction algorithm
0 references
binary feasibility problems
0 references
nonconvex quadratic optimization
0 references
potential function
0 references
graph coloring problem
0 references
0 references
