Discrete Optimization, ISSN 1572-5286, 05/2013, Volume 10, Issue 2, pp. 155 - 162

In the generalized max flow problem, the aim is to find a maximum flow in a generalized network, i.e., a network with multipliers on the arcs that specify...

Series–parallel graph | Generalized flow | Max flow problem | Integral flow | Series-parallel graph | MATHEMATICS, APPLIED | NETWORK | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | MAXIMUM FLOW | ALGORITHMS | Algorithms

Series–parallel graph | Generalized flow | Max flow problem | Integral flow | Series-parallel graph | MATHEMATICS, APPLIED | NETWORK | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | MAXIMUM FLOW | ALGORITHMS | Algorithms

Journal Article

Theoretical Computer Science, ISSN 0304-3975, 2010, Volume 411, Issue 38, pp. 3493 - 3506

In this paper, we study tree automata for directed acyclic graphs (DAGs). We define the movement of a tree automaton on a DAG so that a DAG is accepted by a...

Series–parallel graph | Directed acyclic graph | Generalized series–parallel graph | Spanning tree | Tree automaton | NP-completeness | Seriesparallel graph | Generalized seriesparallel graph | Series parallel graph | Generalized series parallel graph | GRAMMAR | COMPUTER SCIENCE, THEORY & METHODS | Robots | Trees | Graphs | Automation | Movement | C (programming language) | Recognition

Series–parallel graph | Directed acyclic graph | Generalized series–parallel graph | Spanning tree | Tree automaton | NP-completeness | Seriesparallel graph | Generalized seriesparallel graph | Series parallel graph | Generalized series parallel graph | GRAMMAR | COMPUTER SCIENCE, THEORY & METHODS | Robots | Trees | Graphs | Automation | Movement | C (programming language) | Recognition

Journal Article

BIOINFORMATICS 2018 - 9th International Conference on Bioinformatics Models, Methods and Algorithms, Proceedings; Part of 11th International Joint Conference on Biomedical Engineering Systems and Technologies, BIOSTEC 2018, 2018, Volume 3, pp. 105 - 111

Conference Proceeding

Mathematics in Computer Science, ISSN 1661-8270, 06/2016, Volume 10, Issue 2, pp. 239 - 248

To access, purchase, authenticate, or subscribe to the full-text of this article, please visit this link: http://dx.doi.org/10.1007/s11786-016-0260-6 Given a...

Generalized theta graph | T-span | Crown graph | Mobius ladder | Series-parallel graph | T-edge span | Wrapped butterfly network | Circular ladder | T-coloring

Generalized theta graph | T-span | Crown graph | Mobius ladder | Series-parallel graph | T-edge span | Wrapped butterfly network | Circular ladder | T-coloring

Journal Article

Networks, ISSN 0028-3045, 08/2005, Volume 46, Issue 1, pp. 1 - 21

For the past few decades, combinatorial optimization techniques have been shown to be powerful tools for formulating and solving optimization problems arising...

hop‐constraint | heuristic | survivable network | polyhedral approach | Polyhedral approach | Hop-constraint | Survivable network | Heuristic | SPANNING TREE PROBLEM | COMPUTER SCIENCE, HARDWARE & ARCHITECTURE | COMMUNICATION-NETWORKS | PARTITION INEQUALITIES | SERIES-PARALLEL GRAPHS | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | CONNECTIVITY CONSTRAINTS | INTEGER POLYHEDRA | APPROXIMATION ALGORITHM | DISJOINT PATHS | GENERALIZED STEINER PROBLEM | SUBGRAPH POLYTOPES | hop-constraint

hop‐constraint | heuristic | survivable network | polyhedral approach | Polyhedral approach | Hop-constraint | Survivable network | Heuristic | SPANNING TREE PROBLEM | COMPUTER SCIENCE, HARDWARE & ARCHITECTURE | COMMUNICATION-NETWORKS | PARTITION INEQUALITIES | SERIES-PARALLEL GRAPHS | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | CONNECTIVITY CONSTRAINTS | INTEGER POLYHEDRA | APPROXIMATION ALGORITHM | DISJOINT PATHS | GENERALIZED STEINER PROBLEM | SUBGRAPH POLYTOPES | hop-constraint

Journal Article

Discrete Mathematics, ISSN 0012-365X, 2005, Volume 290, Issue 2, pp. 183 - 210

Given an undirected network G = ( V , E ) , a vector of nonnegative integers r = ( r ( v ) : v ∈ V ) associated with the nodes of G and weights on the edges of...

Polyhedron | Series–parallel graph | Survivable network | Cut | Polynomial algorithm | Series-parallel graph | DESIGN | polyhedron | cut | COMMUNICATION-NETWORKS | survivable network | polynomial algorithm | series-parallel graph | DOMINANT | GRAPHS | MATHEMATICS | TREE POLYTOPE | SERIES-PARALLEL NETWORKS | APPROXIMATION ALGORITHM | CONSTRAINTS | GENERALIZED STEINER PROBLEM | SUBGRAPH POLYTOPES | Algorithms

Polyhedron | Series–parallel graph | Survivable network | Cut | Polynomial algorithm | Series-parallel graph | DESIGN | polyhedron | cut | COMMUNICATION-NETWORKS | survivable network | polynomial algorithm | series-parallel graph | DOMINANT | GRAPHS | MATHEMATICS | TREE POLYTOPE | SERIES-PARALLEL NETWORKS | APPROXIMATION ALGORITHM | CONSTRAINTS | GENERALIZED STEINER PROBLEM | SUBGRAPH POLYTOPES | Algorithms

Journal Article

Discrete Applied Mathematics, ISSN 0166-218X, 2002, Volume 119, Issue 3, pp. 227 - 250

Let G=( V, E) be a finite and undirected graph without loops and multiple edges. An edge is said to dominate itself and any edge adjacent to it. A subset D of...

Perfect edge domination | Planar bipartite graphs | Algorithms | Efficient edge domination | Generalized series–parallel graphs | Chordal graphs | Generalized series-parallel graphs | efficient edge domination | algorithms | MATHEMATICS, APPLIED | PERMUTATION GRAPHS | perfect edge domination | generalized series-parallel graphs | chordal graphs | COCOMPARABILITY GRAPHS | planar bipartite graphs

Perfect edge domination | Planar bipartite graphs | Algorithms | Efficient edge domination | Generalized series–parallel graphs | Chordal graphs | Generalized series-parallel graphs | efficient edge domination | algorithms | MATHEMATICS, APPLIED | PERMUTATION GRAPHS | perfect edge domination | generalized series-parallel graphs | chordal graphs | COCOMPARABILITY GRAPHS | planar bipartite graphs

Journal Article

Journal of Information Science and Engineering, ISSN 1016-2364, 05/1999, Volume 15, Issue 3, pp. 407 - 417

Generalized series-parallel (GSP) graphs belong to the class of decomposable graphs which can be represented by their decomposition trees. Given a...

generalized series-parallel graph | CRCW PRAM | decomposition tree | parallel algorithm | ALGORITHM | COMPUTER SCIENCE, INFORMATION SYSTEMS | decomposable graph

generalized series-parallel graph | CRCW PRAM | decomposition tree | parallel algorithm | ALGORITHM | COMPUTER SCIENCE, INFORMATION SYSTEMS | decomposable graph

Journal Article

Journal of Combinatorial Theory, Series B, ISSN 0095-8956, 11/2001, Volume 83, Issue 2, pp. 272 - 297

The generalized theta graph Θs1, …, sk consists of a pair of endvertices joined by k internally disjoint paths of lengths s1, …, sk⩾1. We prove that the roots...

complete bipartite graph | Lambert W function | series-parallel graph | chromatic roots | Potts model | generalized theta graph | graph | chromatic polynomial | Generalized theta graph | Graph | Chromatic polynomial | Complete bipartite graph | Series-parallel graph | Chromatic roots | POLYNOMIALS | MATHEMATICS

complete bipartite graph | Lambert W function | series-parallel graph | chromatic roots | Potts model | generalized theta graph | graph | chromatic polynomial | Generalized theta graph | Graph | Chromatic polynomial | Complete bipartite graph | Series-parallel graph | Chromatic roots | POLYNOMIALS | MATHEMATICS

Journal Article

Networks, ISSN 0028-3045, 12/1997, Volume 30, Issue 4, pp. 293 - 306

The (K, j)‐reliability of a K‐terminal network G is the probability that after the failure of some of its edges the vertices in K will lie in no more than j...

K ES COMPUTER SCIENCE, HARDWARE & ARCHITECTURE | COMPUTER SCIENCE, HARDWARE & ARCHITECTURE | DOMINATION THEORY | SERIES-PARALLEL NETWORKS | ALGORITHM | CRAPO BETA-INVARIANT | GENERALIZED ACTIVITIES | K-TERMINAL RELIABILITY

K ES COMPUTER SCIENCE, HARDWARE & ARCHITECTURE | COMPUTER SCIENCE, HARDWARE & ARCHITECTURE | DOMINATION THEORY | SERIES-PARALLEL NETWORKS | ALGORITHM | CRAPO BETA-INVARIANT | GENERALIZED ACTIVITIES | K-TERMINAL RELIABILITY

Journal Article

Discrete Applied Mathematics, ISSN 0166-218X, 08/2015, Volume 190-191, pp. 86 - 99

We study an extension of the well-known generalized maximum flow problem in which the outflow of an edge is a strictly increasing convex function of its...

Network flow algorithms | Computational complexity | Maximum flows | Generalized flows | Flow decomposition | MATHEMATICS, APPLIED | GAINS | NETWORKS | Algorithms

Network flow algorithms | Computational complexity | Maximum flows | Generalized flows | Flow decomposition | MATHEMATICS, APPLIED | GAINS | NETWORKS | Algorithms

Journal Article

Journal of Graph Theory, ISSN 0364-9024, 06/2017, Volume 85, Issue 2, pp. 297 - 335

The partition of graphs into “nice” subgraphs is a central algorithmic problem with strong ties to matching theory. We study the partitioning of undirected...

graph factors | generalized matching problem | graph packing | P-Partition | Geometry and Topology | graph algorithms | P3‐Partition | Partition | INTERVAL-GRAPHS | PATH PARTITION | P-3-PARTITION | ORIENTATIONS | MATHEMATICS | RECOGNITION ALGORITHM | COMPLEXITY | CHORDAL GRAPHS | BIPARTITE GRAPHS | Bioinformatics | Data Structures and Algorithms | Computer Science | Computational Complexity

graph factors | generalized matching problem | graph packing | P-Partition | Geometry and Topology | graph algorithms | P3‐Partition | Partition | INTERVAL-GRAPHS | PATH PARTITION | P-3-PARTITION | ORIENTATIONS | MATHEMATICS | RECOGNITION ALGORITHM | COMPLEXITY | CHORDAL GRAPHS | BIPARTITE GRAPHS | Bioinformatics | Data Structures and Algorithms | Computer Science | Computational Complexity

Journal Article

Entropy, ISSN 1099-4300, 06/2013, Volume 15, Issue 6, pp. 2448 - 2463

Deriving the form of the optimal solution of a maximum entropy problem, we obtain an infinite family of linear inequalities characterizing the polytope of spin...

Moment problem | Bell's inequalities | Spin system | Maximum entropy | Correlation matrix | moment problem | GENERALIZED INTERPOLATION | NEVANLINNA-PICK INTERPOLATION | PHYSICS, MULTIDISCIPLINARY | OPTIMIZATION APPROACH | maximum entropy | correlation matrix | STATISTICAL MECHANICS | COMPLETION PROBLEM | INFORMATION THEORY | spin system | SPECTRUM | COVARIANCE | COMPLEXITY CONSTRAINT | DEGREE CONSTRAINT | Bell’s inequalities

Moment problem | Bell's inequalities | Spin system | Maximum entropy | Correlation matrix | moment problem | GENERALIZED INTERPOLATION | NEVANLINNA-PICK INTERPOLATION | PHYSICS, MULTIDISCIPLINARY | OPTIMIZATION APPROACH | maximum entropy | correlation matrix | STATISTICAL MECHANICS | COMPLETION PROBLEM | INFORMATION THEORY | spin system | SPECTRUM | COVARIANCE | COMPLEXITY CONSTRAINT | DEGREE CONSTRAINT | Bell’s inequalities

Journal Article

Journal of Combinatorial Optimization, ISSN 1382-6905, 4/2017, Volume 33, Issue 3, pp. 897 - 923

A class $$\mathcal{G}$$ G of simple graphs is said to be girth-closed (odd-girth-closed) if for any positive integer g there exists a graph $$\mathrm {G} \in...

Integer programming | Convex and Discrete Geometry | Generalized Petersen graphs | Pentagon problem | Odd girth | Circular colouring | Mathematics | Theory of Computation | Mathematical Modeling and Industrial Mathematics | Operation Research/Decision Theory | Combinatorics | Optimization | MATHEMATICS, APPLIED | HOMOMORPHISMS | COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS

Integer programming | Convex and Discrete Geometry | Generalized Petersen graphs | Pentagon problem | Odd girth | Circular colouring | Mathematics | Theory of Computation | Mathematical Modeling and Industrial Mathematics | Operation Research/Decision Theory | Combinatorics | Optimization | MATHEMATICS, APPLIED | HOMOMORPHISMS | COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS

Journal Article

Networks, ISSN 0028-3045, 08/2015, Volume 66, Issue 1, pp. 33 - 39

In the freight car dispatching problem, empty freight cars have to be assigned to known demands respecting a given time horizon and certain constraints. The...

dispatching | complexity | approximation | logistics | heuristic | generalized flow | transportation | CONTAINERS | COMPUTER SCIENCE, HARDWARE & ARCHITECTURE | OPERATIONS | ALGORITHM | FLEET MANAGEMENT | ALLOCATION | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | TRAIN TIMETABLING PROBLEM | MODELS | OPTIMIZATION | SCALE | EMPTY | Exchange | Networks | Approximation | Customers | Transportation | Freight cars | Automobiles | Automotive engineering

dispatching | complexity | approximation | logistics | heuristic | generalized flow | transportation | CONTAINERS | COMPUTER SCIENCE, HARDWARE & ARCHITECTURE | OPERATIONS | ALGORITHM | FLEET MANAGEMENT | ALLOCATION | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | TRAIN TIMETABLING PROBLEM | MODELS | OPTIMIZATION | SCALE | EMPTY | Exchange | Networks | Approximation | Customers | Transportation | Freight cars | Automobiles | Automotive engineering

Journal Article

MAPAN, ISSN 0970-3950, 3/2019, Volume 34, Issue 1, pp. 79 - 91

The knowledge about the availability of the component states of a system plays a crucial role in studying the assessment techniques of availability of the...

Availability | Markov process | Mathematical Methods in Physics | Measurement Science and Instrumentation | Theoretical, Mathematical and Computational Physics | Differential equations | Numerical and Computational Physics, Simulation | Physics | Generalized fuzzy number | PETRI NETS | INSTRUMENTS & INSTRUMENTATION | PHYSICS, APPLIED | SET-THEORY | RELIABILITY | PERFORMANCE EVALUATION | RANKING | Markov processes | Refining | Statistics | Analysis | Petroleum

Availability | Markov process | Mathematical Methods in Physics | Measurement Science and Instrumentation | Theoretical, Mathematical and Computational Physics | Differential equations | Numerical and Computational Physics, Simulation | Physics | Generalized fuzzy number | PETRI NETS | INSTRUMENTS & INSTRUMENTATION | PHYSICS, APPLIED | SET-THEORY | RELIABILITY | PERFORMANCE EVALUATION | RANKING | Markov processes | Refining | Statistics | Analysis | Petroleum

Journal Article

2013, 1, Wiley Series in Bioinformatics, ISBN 1118345789, Volume 22, 17

The authors in this chapter develop a computationally much more efficient approach based on homomorphisms and homeomorphisms, allowing toleration of the...

network alignment algorithm | generalized dynamic programming algorithm | bounded treewidth | generalized network alignment | metabolic network alignment

network alignment algorithm | generalized dynamic programming algorithm | bounded treewidth | generalized network alignment | metabolic network alignment

Book Chapter

Chaos: An Interdisciplinary Journal of Nonlinear Science, ISSN 1054-1500, 07/2017, Volume 27, Issue 7, p. 073113

In this paper, we show that novel autonomous chaotic oscillators based on one or two bipolar junction transistors and a limited number of passive components...

MATHEMATICS, APPLIED | GENERALIZED SYNCHRONIZATION | BEHAVIOR | TIME-SERIES | IMPLEMENTATION | SYSTEMS | PHYSICS, MATHEMATICAL | COMPLEX NETWORKS | CIRCUIT

MATHEMATICS, APPLIED | GENERALIZED SYNCHRONIZATION | BEHAVIOR | TIME-SERIES | IMPLEMENTATION | SYSTEMS | PHYSICS, MATHEMATICAL | COMPLEX NETWORKS | CIRCUIT

Journal Article

OPSEARCH, ISSN 0030-3887, 3/2019, Volume 56, Issue 1, pp. 123 - 150

The joint buffer and server optimization problem (BCAP) is a non-linear optimization problem with integer decision variables that optimizes the numbers of...

Business and Management | Generalized expansion method | Operations Research/Decision Theory | Buffer and server allocation | Mathematics, general | Finite queues | Management | Queueing networks | File servers | Models | Algorithms | Mathematical optimization | Literature reviews | Operations research | Approximation | Queuing theory | Queues | Buffers | Optimization | Powell algorithms

Business and Management | Generalized expansion method | Operations Research/Decision Theory | Buffer and server allocation | Mathematics, general | Finite queues | Management | Queueing networks | File servers | Models | Algorithms | Mathematical optimization | Literature reviews | Operations research | Approximation | Queuing theory | Queues | Buffers | Optimization | Powell algorithms

Journal Article

Optimization Methods and Software, ISSN 1055-6788, 09/2015, Volume 30, Issue 5, pp. 965 - 1001

In this paper, we model a multi-mode time-cost-quality trade-off project scheduling problem under generalized precedence relations using mixed-integer...

partial bound enumeration algorithm | efficient epsilon-constraint method | generalized precedence relations | time-cost-quality trade-off | particle swarm optimization | time-costquality trade-off | MATHEMATICS, APPLIED | EFFICIENT EPSILON-CONSTRAINT | PROJECT | MANAGEMENT | MODEL | GENETIC ALGORITHM | COMPUTER SCIENCE, SOFTWARE ENGINEERING | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | DISCRETE-TIME | Algorithms | Project management | Quality | Methods | Mathematical programming | Sensitivity analysis | Computer simulation | Tradeoffs | Self adaptive control systems | Mathematical models | Computer programs

partial bound enumeration algorithm | efficient epsilon-constraint method | generalized precedence relations | time-cost-quality trade-off | particle swarm optimization | time-costquality trade-off | MATHEMATICS, APPLIED | EFFICIENT EPSILON-CONSTRAINT | PROJECT | MANAGEMENT | MODEL | GENETIC ALGORITHM | COMPUTER SCIENCE, SOFTWARE ENGINEERING | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | DISCRETE-TIME | Algorithms | Project management | Quality | Methods | Mathematical programming | Sensitivity analysis | Computer simulation | Tradeoffs | Self adaptive control systems | Mathematical models | Computer programs

Journal Article

No results were found for your search.

Cannot display more than 1000 results, please narrow the terms of your search.