The following pages link to (Q3048571):
Displaying 50 items.
- An optimization modeling for customer redistribution and its spreadsheet implementation (Q1891246) (← links)
- Combinatorial relaxation algorithm for the maximum degree of subdeterminants: Computing Smith-McMillan form at infinity and structural indices in Kronecker form (Q1894574) (← links)
- A constrained matching problem (Q1897380) (← links)
- On the core of the minimum cost Steiner tree game in networks (Q1897387) (← links)
- An efficient parallel algorithm for shortest paths in planar layered digraphs (Q1899220) (← links)
- Valid inequalities and facets for a hypergraph model of the nonlinear knapsack and the FMS part selection problems (Q1904710) (← links)
- New algorithms for linear \(k\)-matroid intersection and matroid \(k\)-parity problems (Q1906282) (← links)
- An algebraic technique for generating optimal CMOS circuitry in linear time (Q1913433) (← links)
- An efficient cost scaling algorithm for the assignment problem (Q1914072) (← links)
- Shortest paths algorithms: Theory and experimental evaluation (Q1919099) (← links)
- An approach for the network flow problem with multiple objectives (Q1919979) (← links)
- Maximum cycle-means of weighted digraphs (Q1920444) (← links)
- A linear time algorithm for maximum matchings in convex, bipartite graphs (Q1921260) (← links)
- Calculating some inverse linear programming problems (Q1923457) (← links)
- Preference profiles determining the proposals in the Gale-Shapley algorithm for stable matching problems (Q1926654) (← links)
- Min-cost multiflows in node-capacitated undirected networks (Q1928531) (← links)
- A computational study of solution approaches for the resource constrained elementary shortest path problem (Q1945074) (← links)
- Weighted inverse maximum perfect matching problems under the Hamming distance (Q1945512) (← links)
- Optimising waiting at nodes in time-dependent networks: cost functions and applications (Q1949565) (← links)
- Algorithms and codes for dense assignment problems: The state of the art (Q1962018) (← links)
- A note on competing-agent Pareto-scheduling (Q1996756) (← links)
- Improving solution times for stable matching problems through preprocessing (Q2027037) (← links)
- Representative families for matroid intersections, with applications to location, packing, and covering problems (Q2028091) (← links)
- Single-machine hierarchical scheduling with release dates and preemption to minimize the total completion time and a regular criterion (Q2030503) (← links)
- Complexity of packing common bases in matroids (Q2039228) (← links)
- A unifying model for locally constrained spanning tree problems (Q2045044) (← links)
- Faster algorithms for quantitative verification in bounded treewidth graphs (Q2058390) (← links)
- Pfaffian pairs and parities: counting on linear matroid intersection and parity problems (Q2061881) (← links)
- Output sensitive fault tolerant maximum matching (Q2097219) (← links)
- An alternate approach to solve two-level priority based assignment problem (Q2114824) (← links)
- The generalized dependency constrained spanning tree problem (Q2132411) (← links)
- The assignment problem revisited (Q2136890) (← links)
- Pareto-scheduling of two competing agents with their own equal processing times (Q2140187) (← links)
- Fair-by-design matching (Q2212506) (← links)
- Shortest path network problems with stochastic arc weights (Q2230798) (← links)
- Approximation algorithms for some min-max postmen cover problems (Q2241210) (← links)
- On the notion of generalized minor in topological network theory and matroids (Q2250913) (← links)
- Approximating the minimum cycle mean (Q2253203) (← links)
- Breakout local search for the Steiner tree problem with revenue, budget and hop constraints (Q2255904) (← links)
- A priority based assignment problem (Q2293428) (← links)
- A survey of network interdiction models and algorithms (Q2294622) (← links)
- Bicriteria scheduling of equal length jobs on uniform parallel machines (Q2307491) (← links)
- Generalized matroid matching (Q2309561) (← links)
- On dual integrality in matching problems (Q2314407) (← links)
- A module-theoretic approach to matroids (Q2318422) (← links)
- On some matching problems under the color-spanning model (Q2319899) (← links)
- The maximum ratio clique problem (Q2356159) (← links)
- Nonlinear neural networks for solving the shortest path problem (Q2381352) (← links)
- Parallel machine scheduling with machine availability and eligibility constraints (Q2384614) (← links)
- Algorithms for solving the symmetry number problem on trees (Q2390304) (← links)
