scientific article

Publication date: 1979

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

travelling salesman problem multidimensional knapsack problem shortest path problems multicommodity network flows non-polynomial problems

Mathematics Subject Classification ID

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Linear programming (90C05) Graph theory (including graph drawing) in computer science (68R10) Combinatorial aspects of matroids and geometric lattices (05B35) Applications of graph theory to circuits and networks (94C15) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics (05-01) Algorithms in computer science (68W99) Graph theory (05Cxx)

Related Items

A discrete model for studying existence and uniqueness of solutions in nonlinear resistive circuits, Quasi-linear production systems: Optimization of the transportation system, Second main theorem in the tropical projective space, A polynomial algorithm for the extendability problem in bipartite graphs, The multi-layered network design problem, Dioïds and semirings: Links to fuzzy sets and other applications, A travelling salesman approach to solve the \(F\)/no-idle/\(C_{max}\) problem, Idempotent and tropical mathematics; complexity of algorithms and interval analysis, Solides non organisés : définition, implantation et plongement, Une approche hybride pour le sac à dos multidimensionnel en variables 0–1, On an approximation measure founded on the links between optimization and polynomial approximation theory, A new approach for crew pairing problems by column generation with an application to air transportation, Dynamic analysis of repetitive decision-free discrete-event processes: The algebra of timed marked graphs and algorithmic issues, Graph partitioning applied to the logic testing of combinational circuits, Deadlocks and traps in Petri nets as Horn-satisfiability solutions and some related polynomially solvable problems, Bideterminants, arborescences and extension of the matrix-tree theorem to semirings, An evolutionary algorithm based hyper-heuristic framework for the set packing problem, Network games; adaptations to Nash-Cournot equilibrium, Maxpolynomial equations, Exact decomposition approaches for Markov decision processes: a survey, Scheduling jobs within time windows on identical parallel machines: New model and algorithms, A definition of surfaces of \({\mathbb{Z}}^{3}\). A new 3D discrete Jordan theorem, The synthesis problem for elementary net systems is NP-complete, Universal algorithms for solving the matrix Bellman equations over semirings, Error minimization methods in biproportional apportionment, Modeling and solving a crew assignment problem in air transportation, Dynamic programming and minimum risk paths, Application of an optimization problem in max-plus algebra to scheduling problems, Generalized path-finding algorithms on semirings and the fuzzy shortest path problem., Inclines and incline matrices: A survey., Minimax algebra and applications, A minimum mean cycle cancelling method for nonlinear multicommodity flow problems, Lagrangean decomposition for integer nonlinear programming with linear constraints, Propagating belief functions through constraint systems, Shortest path algorithms: A computational study with the C programming language, Unconstrained 0-1 nonlinear programming: A nondifferentiable approach, Raffinement de la borne spectrale d'un faisceau de matrices, A genetic algorithm with tabu search procedure for flexible job shop scheduling with transportation constraints and bounded processing times, Multiple Routing Strategies in a Labelled Network, A new branch and bound-enhanced genetic algorithm for the manufacturing cell formation problem, On the probabilistic minimum coloring and minimum \(k\)-coloring, Unlabelled Partition Systems: Optimization and Complexity, Valid inequalities and lifting procedures for the shortest path problem in digraphs with negative cycles, Two-stage stochastic matching and spanning tree problems: polynomial instances and approximation, Bundle-based relaxation methods for multicommodity capacitated fixed charge network design, Lagrangean methods for 0-1 quadratic problems, Eigenvalues and eigen-functionals of diagonally dominant endomorphisms in Min-Max analysis, A combinatorial algorithm for the Euler equations of incompressible flows, Généralisation Max-Plus des bornes de Lageweg, Lenstra et Rinnooy Kan, A polynomial algorithm for minimum quadratic cost flow problems, Tensor products of idempotent semimodules. An algebraic approach, On lower bounds for numbered complete graphs, A systolic array algorithm for the algebraic path problem (shortest paths; matrix inversion), Maximizing a supermodular pseudoboolean function: A polynomial algorithm for supermodular cubic functions