scientific article; zbMATH DE number 3783030
From MaRDI portal
Publication:3960718
multicommodity network flowsmultidimensional knapsack problemnon-polynomial problemsshortest path problemstravelling salesman problem
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics (05-01) Combinatorial aspects of matroids and geometric lattices (05B35) Graph theory (05Cxx) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Graph theory (including graph drawing) in computer science (68R10) Algorithms in computer science (68W99) Linear programming (90C05) Applications of graph theory to circuits and networks (94C15)
Cited in
(57)- 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
- Quasi-linear production systems: Optimization of the transportation system
- A new approach for crew pairing problems by column generation with an application to air transportation
- Minimax algebra and applications
- 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
- A combinatorial algorithm for the Euler equations of incompressible flows
- On lower bounds for numbered complete graphs
- A discrete model for studying existence and uniqueness of solutions in nonlinear resistive circuits
- On an approximation measure founded on the links between optimization and polynomial approximation theory
- Bideterminants, arborescences and extension of the matrix-tree theorem to semirings
- 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
- Generalized path-finding algorithms on semirings and the fuzzy shortest path problem.
- Inclines and incline matrices: A survey.
- Tensor products of idempotent semimodules. An algebraic approach
- A genetic algorithm with tabu search procedure for flexible job shop scheduling with transportation constraints and bounded processing times
- Lagrangean methods for 0-1 quadratic problems
- Eigenvalues and eigen-functionals of diagonally dominant endomorphisms in Min-Max analysis
- A travelling salesman approach to solve the \(F\)/no-idle/\(C_{max}\) problem
- Graph partitioning applied to the logic testing of combinational circuits
- Network games; adaptations to Nash-Cournot equilibrium
- Maxpolynomial equations
- Error minimization methods in biproportional apportionment
- A minimum mean cycle cancelling method for nonlinear multicommodity flow problems
- 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
- The multi-layered network design problem
- Dioïds and semirings: Links to fuzzy sets and other applications
- 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
- A new branch and bound-enhanced genetic algorithm for the manufacturing cell formation problem
- On the probabilistic minimum coloring and minimum k-coloring
- Idempotent and tropical mathematics; complexity of algorithms and interval analysis
- Dynamic analysis of repetitive decision-free discrete-event processes: The algebra of timed marked graphs and algorithmic issues
- Deadlocks and traps in Petri nets as Horn-satisfiability solutions and some related polynomially solvable problems
- An evolutionary algorithm based hyper-heuristic framework for the set packing problem
- Multiple routing strategies in a labelled network
- Second main theorem in the tropical projective space
- A polynomial algorithm for the extendability problem in bipartite graphs
- Unlabelled Partition Systems: Optimization and Complexity
- Raffinement de la borne spectrale d'un faisceau de matrices
- Solides non organisés : définition, implantation et plongement
- Une approche hybride pour le sac à dos multidimensionnel en variables 0–1
- Généralisation Max-Plus des bornes de Lageweg, Lenstra et Rinnooy Kan
- Bundle-based relaxation methods for multicommodity capacitated fixed charge network design
- Exact decomposition approaches for Markov decision processes: a survey
- On the interpretation of the interaction index between criteria in a Choquet integral model
- Tropical Nevanlinna theory in several variables
- Nevanlinna theory for tropical hypersurfaces
- A polynomial algorithm for minimum quadratic cost flow problems
- Universal algorithms for solving the matrix Bellman equations over semirings
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3960718)
