scientific article; zbMATH DE number 1528191

zbMath0963.90066MaRDI QIDQ4515163

Carl-Louis Sandblom, H. A. Eiselt

Publication date: 12 November 2000

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

aggregationalgorithmslinear programmingheuristicsinteger programmingshortest pathsimulated annealingSteiner tree problemgenetic algorithmsgraphsknapsack problemtraveling salesman problemset coveringnetwork designnetwork flowtree networkspolyhedral combinatoricsminimal spanning treearc routing problemopen pit miningcutting plane methodsbranch and bound methodsmaximal flowfeasible flowzero-one variablescost-minimal flowflows with congestionforestry harvestingnetwork path models

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10) Deterministic network models in operations research (90B10) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)

Related Items (6)

Optimal wholesale facilities location within the fruit and vegetables supply chain with bimodal transportation options: an LP-MIP heuristic approach ⋮ A balanced team generating model ⋮ Combining NP-Hard Reduction Techniques and Strong Heuristics in an Exact Algorithm for the Maximum-Weight Connected Subgraph Problem ⋮ Special sales with guaranteed minimum duration but uncertain termination date ⋮ Variable neighborhood search for the cost constrained minimum label spanning tree and label constrained minimum spanning tree problems ⋮ On the interaction between retailers inventory policies and manufacturer trade deals in response to supply-uncertainty occurrences

This page was built for publication: