A nonlinear programming heuristic for computing optimal link capacities in a multi-hour alternative routing communications network
Year of publication: |
1987
|
---|---|
Authors: | Rosenberg, Eric |
Published in: |
Operations research. - Catonsville, MD : INFORMS, ISSN 0030-364X, ZDB-ID 123389-0. - Vol. 35.1987, 3, p. 354-364
|
Subject: | Programmanalyse nichtlinear | Heuristik | Netzwerkanalyse | Postwesen und Fernmeldewesen | Telefon | Unternehmensforschung | Reihenfolgeproblem | Theorie | Theory | Heuristics | Mathematische Optimierung | Mathematical programming | Tourenplanung | Vehicle routing problem | Nichtlineare Optimierung | Nonlinear programming | Kapazitätsplanung | Capacity planning |
-
Using ℓp-norms for fairness in combinatorial optimisation
Bektaş, Tolga, (2020)
-
Probabilistic tabu search algorithm for container liner shipping problem with speed optimisation
Wang, Shijin, (2022)
-
A heuristic algorithm for the traveling salesman location problem on networks
Simchi-Levi, David, (1988)
- More ...
-
The expected length of a random line segment in a rectangle
Rosenberg, Eric, (2004)
-
Quantitative Methods in Credit Management: A Survey
Rosenberg, Eric, (1994)
-
Hardware configuration for StarLAN 10 local area networks: An application of integer programming
Rosenberg, Eric, (1993)
- More ...