scientific article
From MaRDI portal
Publication:3751390
zbMath0611.90096MaRDI QIDQ3751390
Publication date: 1984
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35) Numerical mathematical programming methods (65K05) Integer programming (90C10) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics (05-01)
Related Items
Dependency structure analysis as combinatorial optimization ⋮ New algorithms for generalized network flows ⋮ Periodicity and critical circuits in a generalized max-algebra setting ⋮ On some topological properties of a strongly connected compartmental system with application to the identifiability problem ⋮ A vertex oriented approach to the equal remaining obligations rule for minimum cost spanning tree situations ⋮ Flatwords and Post Correspondence Problem ⋮ Near optimal design of wavelength routed optical networks ⋮ Graph nodes and a definition of structural similarity ⋮ Powers of matrices over an extremal algebra with applications to periodic graphs ⋮ On the intersection of two particular convex sets ⋮ A bulk-synchronous parallel process algebra ⋮ Minimax regret spanning arborescences under uncertain costs ⋮ Column generation and rounding heuristics for minimizing the total weighted completion time on a single batching machine ⋮ Algebraic Methods Applied to Network Reliability Problems ⋮ Efficient algorithms for solving systems of linear equations and path problems ⋮ Local and global robustness with \(q\)-step delay for max-plus linear systems ⋮ Affine routing for robust network design ⋮ The robust cyclic job shop problem ⋮ Approximation algorithms for feasible cut and multicut problems ⋮ Isodistant points in competitive network facility location ⋮ Filter-embedding semiring fusion for programming with MapReduce ⋮ Feedback control to guarantee marking constraints in timed event graphs including disturbances: application to disassembly systems ⋮ Application of graph theory to topology generation for logic gates ⋮ A branch-and-price approach for harvest scheduling subject to maximum area restrictions ⋮ A Note on the Existence of All (g,f)-Factors ⋮ Algorithms for approximate subtropical matrix factorization ⋮ An efficient parallel algorithm for shortest paths in planar layered digraphs ⋮ Inverse source problem in a forced network ⋮ Minimum spanning table and optimal expansion of competence set ⋮ Filtering AtMostNValue with difference constraints: application to the shift minimisation personnel task scheduling problem ⋮ Performance modeling and optimization of networks of bridged LANs ⋮ ANALYZING VULNERABILITIES OF CRITICAL INFRASTRUCTURES USING FLOWS AND CRITICAL VERTICES IN AND/OR GRAPHS ⋮ Trends in systolic and cellular computation ⋮ Interval propagation to reason about sets: Definition and implementation of a practical language ⋮ A combinatorial interior point method for network flow problems ⋮ Network-based reconfiguration routes for a self-reconfigurable robot ⋮ Optimal design of LAN-WAN internetworks: An approach using simulated annealing ⋮ A simple GAP-canceling algorithm for the generalized maximum flow problem ⋮ The minimum cost shortest-path tree game ⋮ On pseudounimodular matrices ⋮ Maximum network flows with concave gains ⋮ A SAT approach to query optimization in mediator systems ⋮ Sufficient conditions for the convergence of a class of nonlinear distributed consensus algorithms ⋮ State‐Feedback Control for a Class of Timed Petri Nets Subject to Marking Constraints ⋮ Constraint propagation for ordering, abstraction, and aggregation relations ⋮ Periodic schedules for linear precedence constraints ⋮ Dynamic routing in open queueing networks: Brownian models, cut constraints and resource pooling ⋮ An Optimal Constraint Programming Approach to the Open-Shop Problem ⋮ EFFICIENT ALGORITHMS FOR THE OPTIMAL-RATIO REGION DETECTION PROBLEMS IN DISCRETE GEOMETRY WITH APPLICATIONS ⋮ Semi-classical limit and least action principle revisited with \((\min,+)\) path integral and action-particle duality ⋮ Quantitative analysis of continuous weighted marked graphs ⋮ Classical and new heuristics for the open-shop problem: A computational evaluation ⋮ WELL-CONSTRAINED COMPLETION AND DECOMPOSITION FOR UNDER-CONSTRAINED GEOMETRIC CONSTRAINT PROBLEMS ⋮ Emerging spanning trees in the work of Candilis-Josic-Woods ⋮ Models for machine-part grouping in cellular manufacturing ⋮ A new saling algorithm for the maximum mean cut problem ⋮ Fair in the Eyes of Others
