A heuristic for the label printing problem (Q875404): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: An improved branch and bound algorithm for mixed integer nonlinear programs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Numerical Experience with Lower Bounds for MIQP Branch-And-Bound / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Integrating SQP and branch-and-bound for mixed integer nonlinear programming / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Optimization by Simulated Annealing / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5289009 / rank | |||
Normal rank | |||
Revision as of 16:13, 25 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A heuristic for the label printing problem |
scientific article |
Statements
A heuristic for the label printing problem (English)
0 references
13 April 2007
0 references
label printing
0 references
nonlinear integer programming
0 references
heuristic
0 references
simulating annealing
0 references
0 references
