scientific article; zbMATH DE number 3989126

zbMATH Open0611.90096MaRDI QIDQ3751390FDOQ3751390

Authors: Michel Gondran, Michel Minoux 

Publication date: 1984

Title of this publication is not available (Why is that?)

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics (05-01) Extremal problems in graph theory (05C35) Integer programming (90C10) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01)

Cited In (59)

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

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 Q3751390)