The following pages link to (Q3048571):
Displaying 50 items.
- Applications of shortest path algorithms to matrix scalings (Q799343) (← links)
- Label-connected graphs and the gossip problem (Q804593) (← links)
- Fuzzy shortest paths (Q805505) (← links)
- Additive functions and their application to uncertain information (Q805641) (← links)
- Chain packing in graphs (Q808291) (← links)
- Experimental evaluation of a local search approximation algorithm for the multiway cut problem (Q831743) (← links)
- Hierarchical \(b\)-matching (Q831805) (← links)
- Euclidean maximum matchings in the plane -- local to global (Q832859) (← links)
- Fuzzy shortest path problem with finite fuzzy quantities (Q864754) (← links)
- Scheduling machine-dependent jobs to minimize lateness on machines with identical speed under availability constraints (Q868990) (← links)
- Solution of the Liu-Layland problem via bottleneck just-in-time sequencing (Q880504) (← links)
- Single processor scheduling with job values depending on their completion times (Q880588) (← links)
- NP-hardness of two edge cover generalizations with applications to control and bribery for approval voting (Q894461) (← links)
- Parameterized and subexponential-time complexity of satisfiability problems and applications (Q896108) (← links)
- Stability analysis in discrete optimization involving generalized addition operations (Q896189) (← links)
- Guaranteed recovery of planted cliques and dense subgraphs by convex relaxation (Q896191) (← links)
- Spatio-temporal multi-robot routing (Q900215) (← links)
- Scheduling of project networks (Q908839) (← links)
- The generalized assignment problem: Valid inequalities and facets (Q909579) (← links)
- Partitioning multi-edge graphs (Q911315) (← links)
- A survey of dynamic network flows (Q917417) (← links)
- Reconstructing shortest paths (Q918442) (← links)
- Retiming synchronous circuitry (Q920937) (← links)
- The ``molecular'' traveling salesman (Q922393) (← links)
- A \((2-c\frac{1}{\sqrt{N}})\)-approximation algorithm for the stable marriage problem (Q930600) (← links)
- Lower bounds and modified LPT algorithm for \(k\)-partitioning problems with partition matroid constraint (Q933069) (← links)
- George Dantzig's impact on the theory of computation (Q951091) (← links)
- The \(k\)-path tree matroid and its applications to survivable network design (Q951105) (← links)
- Finding Hamiltonian circuits in quasi-adjoint graphs (Q955323) (← links)
- Commitment under uncertainty: Two-stage stochastic matching problems (Q959814) (← links)
- Using combinatorial optimization in model-based trimmed clustering with cardinality constraints (Q962299) (← links)
- Semigroup identities in the monoid of two-by-two tropical matrices. (Q972589) (← links)
- A novel iterative shape from focus algorithm based on combinatorial optimization (Q991937) (← links)
- Recognizing underlying sparsity in optimization (Q1013977) (← links)
- Monochromatic and heterochromatic subgraphs in edge-colored graphs - A survey (Q1014813) (← links)
- \(k\)-partitioning problems with partition matroid constraint (Q1022585) (← links)
- Approximating the maximum clique minor and some subgraph homeomorphism problems (Q1022596) (← links)
- An extension of labeling techniques for finding shortest path trees (Q1027584) (← links)
- Persistency and matroid intersection (Q1035281) (← links)
- A note on a generalized network flow model for manufacturing process (Q1036893) (← links)
- Approximating the longest path length of a stochastic DAG by a normal distribution in linear time (Q1044026) (← links)
- Nowhere-zero integral flows on a bidirected graph (Q1053716) (← links)
- Networks and chain coverings in partial orders and their products (Q1059648) (← links)
- Worst-case choice for the stable marriage problem (Q1063004) (← links)
- An algorithm for finding a matroid basis which maximizes the product of the weights of the elements (Q1068836) (← links)
- A dynamic programming algorithm to find all solutions in a neighborhood of the optimum (Q1072453) (← links)
- An efficient Dijkstra-like labeling method for computing shortest odd/even paths (Q1072571) (← links)
- Computational experience with a polynomial-time dual simplex algorithm for the transportation problem (Q1072935) (← links)
- Combinatorics of orientation reversing polygons (Q1075334) (← links)
- Maximal dynamic polymatroid flows and applications (Q1077321) (← links)
