scientific article; zbMATH DE number 3989126
From MaRDI portal
Publication:3751390
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
(60)- Network-based reconfiguration routes for a self-reconfigurable robot
- On pseudounimodular matrices
- New algorithms for generalized network flows
- 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
- Dependency structure analysis as combinatorial optimization
- A simple GAP-canceling algorithm for the generalized maximum flow problem
- Graph nodes and a definition of structural similarity
- Interval propagation to reason about sets: Definition and implementation of a practical language
- Powers of matrices over an extremal algebra with applications to periodic graphs
- A vertex oriented approach to the equal remaining obligations rule for minimum cost spanning tree situations
- Feedback control to guarantee marking constraints in timed event graphs including disturbances: application to disassembly systems
- 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
- Fair in the Eyes of Others
- Constraint propagation for ordering, abstraction, and aggregation relations
- A bulk-synchronous parallel process algebra
- Periodic schedules for linear precedence constraints
- Flatwords and Post Correspondence Problem
- An efficient parallel algorithm for shortest paths in planar layered digraphs
- Quantitative analysis of continuous weighted marked graphs
- State-feedback control for a class of timed Petri nets subject to marking constraints
- Sufficient conditions for the convergence of a class of nonlinear distributed consensus algorithms
- Two-index formulations for the traveling purchaser problem with incompatibility constraints
- Approximation algorithms for feasible cut and multicut problems
- Near optimal design of wavelength routed optical networks
- Minimax regret spanning arborescences under uncertain costs
- 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
- Application of graph theory to topology generation for logic gates
- 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
- Efficient algorithms for solving systems of linear equations and path problems
- Periodicity and critical circuits in a generalized max-algebra setting
- The robust cyclic job shop problem
- Filter-embedding semiring fusion for programming with MapReduce
- Isodistant points in competitive network facility location
- Local and global robustness with \(q\)-step delay for max-plus linear systems
- Minimum spanning table and optimal expansion of competence set
- scientific article; zbMATH DE number 3215223 (Why is no real title available?)
- 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
- The minimum cost shortest-path tree game
- Filtering AtMostNValue with difference constraints: application to the shift minimisation personnel task scheduling problem
- Models for machine-part grouping in cellular manufacturing
- A combinatorial interior point method for network flow problems
- On the intersection of two particular convex sets
- scientific article; zbMATH DE number 5570830 (Why is no real title available?)
- 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
- 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)
