The following pages link to (Q3330973):
Displaying 46 items.
- Ordered weighted average optimization in multiobjective spanning tree problem (Q1753508) (← links)
- A model predictive control approach for discrete-time rescheduling in complex central railway station areas (Q1761201) (← links)
- An LP-based heuristic algorithm for the node capacitated in-tree packing problem (Q1762017) (← links)
- On a cardinality-constrained transportation problem with market choice (Q1785735) (← links)
- Independent-set reconfiguration thresholds of hereditary graph classes (Q1801058) (← links)
- In search of the densest subgraph (Q2005555) (← links)
- A competitive partnership formation process (Q2016227) (← links)
- Uniform and monotone line sum optimization (Q2028097) (← links)
- Upper and lower degree-constrained graph orientation with minimum penalty (Q2062132) (← links)
- Rees algebras of filtrations of covering polyhedra and integral closure of powers of monomial ideals (Q2078501) (← links)
- A duality theorem for the ic-resurgence of edge ideals (Q2111193) (← links)
- The complexity of vector partition (Q2155634) (← links)
- Max-multiflow/min-multicut for G+H series-parallel (Q2275455) (← links)
- Shared processor scheduling of multiprocessor jobs (Q2282535) (← links)
- Perfect graphs with polynomially computable kernels (Q2283107) (← links)
- Cache me if you can: capacitated selfish replication games in networks (Q2300628) (← links)
- Orientations and detachments of graphs with prescribed degrees and connectivity (Q2339815) (← links)
- An improved approximation algorithm for the traveling salesman problem with relaxed triangle inequality (Q2353642) (← links)
- Strengthening topological colorful results for graphs (Q2359976) (← links)
- On the independent dominating set polytope (Q2368719) (← links)
- Free multiflows in bidirected and skew-symmetric graphs (Q2381535) (← links)
- Note on maximal split-stable subgraphs (Q2381823) (← links)
- Maximum flow under proportional delay constraint (Q2402261) (← links)
- A multivariate framework for weighted FPT algorithms (Q2402359) (← links)
- A dichotomy for minimum cost graph homomorphisms (Q2427539) (← links)
- Replication in critical graphs and the persistence of monomial ideals (Q2434895) (← links)
- 2-clique-bond of stable set polyhedra (Q2446841) (← links)
- A relax-and-cut algorithm for the set partitioning problem (Q2462542) (← links)
- Crown reductions for the minimum weighted vertex cover problem (Q2473030) (← links)
- Multicommodity flows in cycle graphs (Q2499583) (← links)
- Some formulations for the group Steiner tree problem (Q2500536) (← links)
- The uniqueness property for networks with several origin-destination pairs (Q2514826) (← links)
- A one-to-one correspondence between colorings and stable sets (Q2517790) (← links)
- The \(d\)-dimensional rigidity matroid of sparse graphs (Q2565690) (← links)
- On partitioning two matroids into common independent subsets (Q2570121) (← links)
- On the existence of \(k\) edge-disjoint 2-connected spanning subgraphs (Q2573645) (← links)
- On node constraint networks (Q3787765) (← links)
- T-joins in strongly connected hypergraphs (Q4597952) (← links)
- (Q4706894) (← links)
- Derandomization of auctions (Q5892485) (← links)
- Approximate multi-matroid intersection via iterative refinement (Q5918919) (← links)
- A new contraction technique with applications to congruency-constrained cuts (Q5918921) (← links)
- Multi-objective matroid optimization with ordinal weights (Q6046136) (← links)
- Compression with wildcards: all exact or all minimal hitting sets (Q6083242) (← links)
- A perfect secret sharing scheme for general access structures (Q6118655) (← links)
- Polyhedral clinching auctions for indivisible goods (Q6609155) (← links)
