Dynamic optimization of the operation of single-car elevator systems with destination hall call registration. II: The solution algorithm (Q2485348): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: The school bus routing problem: a case study / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The General Pickup and Delivery Problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The pickup and delivery problem with time windows / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The pickup and delivery problem: Faces and branch-and-cut algorithm / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3525911 / rank | |||
Normal rank | |||
Revision as of 13:42, 10 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Dynamic optimization of the operation of single-car elevator systems with destination hall call registration. II: The solution algorithm |
scientific article |
Statements
Dynamic optimization of the operation of single-car elevator systems with destination hall call registration. II: The solution algorithm (English)
0 references
4 August 2005
0 references
Transportation
0 references
Elevator operation
0 references
Destination hall call registration
0 references
Branch-and-bound algorithm
0 references
Lagrangian relaxation
0 references
