scientific article

Maciej M. Sysło, J. S. Kowalik, Narsingh Deo

Publication date: 1983

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

shortest path textbook traveling salesman knapsack problem discrete optimization minimum spanning tree maximum flow computer programs graph coloring problem exact and approximate algorithms set-partitioning-problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35) Numerical mathematical programming methods (65K05) Integer programming (90C10) Linear programming (90C05) Graph theory (including graph drawing) in computer science (68R10) Deterministic scheduling theory in operations research (90B35) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Deterministic network models in operations research (90B10) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01) Boolean programming (90C09) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04)

Related Items (42)

Optimal greedy algorithms for indifference graphs ⋮ Competitive location on a network ⋮ A variable neighbourhood search algorithm for the open vehicle routing problem ⋮ A parallel integer linear programming algorithm ⋮ Minimum cost-reliability ratio path problem ⋮ Heuristic maximization of the number of spanning trees in regular graphs ⋮ An improvement of Viswanathan and Bagchi's exact algorithm for constrained two-dimensional cutting stock ⋮ Welsh-Powell opposition graphs ⋮ Routing and capacity assignment in backbone communication networks ⋮ The traveling salesman problem with backhauls ⋮ The vehicle routing problem with backhauls ⋮ Sequential coloring versus Welsh-Powell bound ⋮ A memory-based iterated local search algorithm for the multi-depot open vehicle routing problem ⋮ The design of a 0-1 integer optimizer and its application in the Carmen system ⋮ The combinatorial bandwidth packing problem ⋮ Fuzzy sets and models of decision making. ⋮ On the stochastic complexity of the asymmetric traveling salesman problem ⋮ An optimal greedy heuristic to color interval graphs ⋮ Approach to decision making in fuzzy environment ⋮ A threshold accepting approach to the Open Vehicle Routing problem ⋮ From the theory to the tools: parallel dynamic programming ⋮ An efficient link allocation algorithm for survivable ATM-based personal communication networks ⋮ An interactive layout heuristic based on hexagonal adjacency graphs ⋮ The selection and scheduling of telecommunication calls with time windows ⋮ Heuristics and lower bounds for the bin packing problem with conflicts ⋮ A tabu search algorithm for the open vehicle routing problem ⋮ Shift rostering using decomposition: assign weekend shifts first ⋮ Combined bus and driver scheduling ⋮ Algorithms of discrete optimization and their application to problems with fuzzy coefficients ⋮ Interval elimination method for stochastic spanning tree problem ⋮ Primary and secondary route selection in backbone communication networks ⋮ Joint object placement and node dimensioning for internet content distribution ⋮ A recursive exact algorithm for weighted two-dimensional cutting ⋮ The DH/KD algorithm: A hybrid approach for unconstrained two-dimensional cutting problems ⋮ Heuristic methods for the sectoring arc routing problem ⋮ A multiplicatively-weighted Voronoi diagram approach to logistics districting ⋮ A general approach to solving a wide class of fuzzy optimization problems ⋮ Routing and capacity assignment in backbone communication networks under time varying traffic conditions ⋮ A heuristic for the multiple tour maximum collection problem ⋮ A period vehicle routing case study ⋮ Basis variables for linear junction structures ⋮ The multiple depot, multiple traveling salesmen facility-location problem: Vehicle range, service frequency, and heuristic implementations

This page was built for publication: