The following pages link to (Q3048571):
Displaying 50 items.
- Finding connected \(k\)-subgraphs with high density (Q2407097) (← links)
- A note on a two-agent scheduling problem related to the total weighted late work (Q2424661) (← links)
- Fuzzy graphs modelling for hazmat telegeomonitoring (Q2433517) (← links)
- Minimizing total tardiness on parallel machines with preemptions (Q2434279) (← links)
- The robustness of interval matrices in max-plus algebra (Q2442283) (← links)
- How many attackers can selfish defenders catch? (Q2444551) (← links)
- Crown reductions for the minimum weighted vertex cover problem (Q2473030) (← links)
- Computing an eigenvector of a Monge matrix in max-plus algebra (Q2474561) (← links)
- Efficient computation of shortest paths in networks using particle swarm optimization and noising metaheuristics (Q2478380) (← links)
- Some further results on minimum distribution cost flow problems (Q2479563) (← links)
- Fast heuristics for the Steiner tree problem with revenues, budget and hop constraints (Q2482819) (← links)
- Product line selection and pricing analysis: impact of genetic relaxations (Q2489113) (← links)
- Computational complexity of isothermic DNA sequencing by hybridization (Q2489897) (← links)
- A new algorithm for the discrete fuzzy shortest path problem in a network (Q2490237) (← links)
- On the characterization of the domination of a diameter-constrained network reliability model (Q2500537) (← links)
- Persistence in discrete optimization under data uncertainty (Q2502201) (← links)
- Min-Max partitioning problem with matroid constraint (Q2519447) (← links)
- The approximability of the weighted Hamiltonian path completion problem on a tree (Q2566021) (← links)
- Recognizing binet matrices (Q2638382) (← links)
- Monotonicity of the core and value in dynamic cooperative games (Q2641231) (← links)
- A mixed integer programming formulation for the total flow time single machine robust scheduling problem with interval data (Q2643723) (← links)
- The hierarchical Chinese postman problem: the slightest disorder makes it hard, yet disconnectedness is manageable (Q2661637) (← links)
- On the complexity of packing rainbow spanning trees (Q2685331) (← links)
- Improved approximation algorithms for some min-max postmen cover problems with applications to the min-max subtree cover (Q2699031) (← links)
- Combination algorithms for Steiner tree variants (Q2700384) (← links)
- Mixing time and simulated annealing for the stochastic cellular automata (Q2701130) (← links)
- A new-old algorithm for minimum-cut and maximum-flow in closure graphs. (Q2744651) (← links)
- Algebraic algorithms for linear matroid parity problems (Q2799476) (← links)
- The Stable Fixtures Problem with Payments (Q2827801) (← links)
- Blossom-Quad: a non-uniform quadrilateral mesh generator using a minimum-cost perfect-matching algorithm (Q2894944) (← links)
- Algorithms for the Maximum Weight Connected $$k$$-Induced Subgraph Problem (Q2942405) (← links)
- Finding Connected Dense $$k$$-Subgraphs (Q2948471) (← links)
- On the Location and p-Median Polytopes (Q2971602) (← links)
- Finding thet-join structure of graphs (Q3030603) (← links)
- Discrete optimization methods for multiprocessor computer systems (Q3034793) (← links)
- Lower planes for the network design problem (Q3037174) (← links)
- Dynamic matchings and quasidynamic fractional matchings. I (Q3040950) (← links)
- Dynamic matchings and quasidynamic fractional matchings. II (Q3040951) (← links)
- Complexity Results for the Spanning Tree Congestion Problem (Q3057608) (← links)
- On the computational complexity of combinatorial flexibility problems (Q3066977) (← links)
- The duality theorem of linear programming: an intuitive approach (Q3150387) (← links)
- Linear-Time Approximation for Maximum Weight Matching (Q3189636) (← links)
- Minimizing the number of grab's changes in a single machine scheduling problem (Q3197848) (← links)
- Computing the generic jordan canonical form (Q3203922) (← links)
- Scheduling identical jobs on uniform parallel machines (Q3204310) (← links)
- Worst-case greedy matchings in the unitd-cube (Q3204344) (← links)
- A New Formulation for the Travelling Salesman Problem (Q3315280) (← links)
- A dual ascent approach for steiner tree problems on a directed graph (Q3315294) (← links)
- Stochastisches PERT — Eine vergleichende Untersuchung über die Effizienz eines Verfahrens zur stochastischen Projektplanung (Q3316941) (← links)
- A quick method for finding shortest pairs of disjoint paths (Q3330991) (← links)
