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