Branch and bound algorithm for the warehouse location problem with the objective function as linear fractional (Q998681): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q1071655 |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / author | |||
| Property / author: Sant R. Arora / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An Efficient Branch and Bound Algorithm for the Warehouse Location Problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Algorithms for the Simple Plant-Location Problem with Some Side Conditions / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Exact solution methods for uncapacitated location problems with convex transportation costs / rank | |||
Normal rank | |||
Latest revision as of 00:48, 29 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Branch and bound algorithm for the warehouse location problem with the objective function as linear fractional |
scientific article |
Statements
Branch and bound algorithm for the warehouse location problem with the objective function as linear fractional (English)
0 references
9 February 2009
0 references
fractional programming
0 references
branch and bound
0 references
open and closed warehouse
0 references
