The following pages link to (Q3048571):
Displaying 50 items.
- Algorithms for the minimum weight of linear codes (Q259293) (← links)
- Fast algorithms for the undirected negative cost cycle detection problem (Q261362) (← links)
- PTAS for densest \(k\)-subgraph in interval graphs (Q261389) (← links)
- Branch-and-price algorithm for the resilient multi-level hop-constrained network design (Q297189) (← links)
- Optimal relay node placement in delay constrained wireless sensor network design (Q297218) (← links)
- A new bound for the midpoint solution in minmax regret optimization with an application to the robust shortest path problem (Q319447) (← links)
- Complexity results for storage loading problems with stacking constraints (Q321101) (← links)
- Community detection by modularity maximization using GRASP with path relinking (Q336716) (← links)
- Algorithms for the quickest path problem and the reliable quickest path problem (Q373197) (← links)
- The weak robustness of interval matrices in max-plus algebra (Q400506) (← links)
- Matching based very large-scale neighborhoods for parallel machine scheduling (Q415566) (← links)
- On flows in simple bidirected and skew-symmetric networks (Q415697) (← links)
- A multicast routing algorithm based on searching in directed graph (Q426417) (← links)
- Linear-code multicast on parallel architectures (Q427139) (← links)
- Possibilistic bottleneck combinatorial optimization problems with ill-known weights (Q433509) (← links)
- Partitioning planar graphs: a fast combinatorial approach for max-cut (Q434180) (← links)
- Polynomial time approximation schemes for the constrained minimum spanning tree problem (Q442910) (← links)
- An algorithm for weighted fractional matroid matching (Q463292) (← links)
- A model for minimizing active processor time (Q487001) (← links)
- A column generation approach for multicast routing and wavelength assignment with delay constraints in heterogeneous WDM networks (Q490218) (← links)
- Solving the parametric bipartite maximum flow problem in unbalanced and closure bipartite graphs (Q492813) (← links)
- On set expansion problems and the small set expansion conjecture (Q494429) (← links)
- The Steiner tree problem with delays: a compact formulation and reduction procedures (Q496653) (← links)
- Phase transition on the convergence rate of parameter estimation under an Ornstein-Uhlenbeck diffusion on a tree (Q504087) (← links)
- A new approach for solving the network problems (Q505104) (← links)
- Shape rectangularization problems in intensity-modulated radiation therapy (Q534786) (← links)
- Maximum outflow in generalized flow networks (Q583080) (← links)
- Maximum sum-of-splits clustering (Q583774) (← links)
- Partial inverse of a monotone operator (Q585088) (← links)
- The theory and practice of distance geometry (Q594021) (← links)
- Optimal placement of UV-based communications relay nodes (Q604957) (← links)
- Bee colony optimization for the \(p\)-center problem (Q632685) (← links)
- An overview of channel assignment methods for multi-radio multi-channel wireless mesh networks (Q666110) (← links)
- Greed is good: Approximating independent sets in sparse and bounded-degree graphs (Q679458) (← links)
- Bounded discrete representations of interval orders (Q686255) (← links)
- Hierarchical decomposition of symmetric discrete systems by matroid and group theories (Q687038) (← links)
- Approximating the tree and tour covers of a graph (Q688437) (← links)
- On worst-case aggregation analysis for network location problems (Q689246) (← links)
- Complexity of the sex-equal stable marriage problem (Q689901) (← links)
- The central curve in linear programming (Q695626) (← links)
- Blossom V: A new implementation of a minimum cost perfect matching algorithm (Q734352) (← links)
- Making sparse matrices sparser: Computational results (Q751503) (← links)
- Structural theorems for submodular functions, polymatroids and polymatroid intersections (Q757383) (← links)
- A polynomial algorithm for minimum quadratic cost flow problems (Q761341) (← links)
- On matroid parity and matching polytopes (Q777400) (← links)
- Recent trends in combinatorial optimization (Q788638) (← links)
- An equivalent subproblem relaxation for improving the solution of a class of transportation scheduling problems (Q792216) (← links)
- Optimal cycles in doubly weighted graphs and approximation of bivariate functions by univariate ones (Q794387) (← links)
- On the number of common bases of two matroids (Q794657) (← links)
- A matroid generalization of theorems of Lewin and Gallai (Q798663) (← links)
