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