The following pages link to (Q4371290):
Displaying 50 items.
- Multidimensional dual-feasible functions and fast lower bounds for the vector packing problem (Q297181) (← links)
- Generalized minor inequalities for the set covering polyhedron related to circulant matrices (Q299092) (← links)
- Scheduling with few changes (Q299829) (← links)
- A new heuristic for detecting non-Hamiltonicity in cubic graphs (Q342098) (← links)
- A simple LP relaxation for the asymmetric traveling salesman problem (Q378136) (← links)
- A bilevel programming problem with maximization of a supermodular function in the lower level (Q385481) (← links)
- Integer-empty polytopes in the 0/1-cube with maximal Gomory-Chvàtal rank (Q408442) (← links)
- Optimality conditions for a bilevel matroid problem (Q411248) (← links)
- Dominance rules in combinatorial optimization problems (Q421551) (← links)
- Polynomial time approximation schemes for the constrained minimum spanning tree problem (Q442910) (← links)
- On the approximability of some degree-constrained subgraph problems (Q444431) (← links)
- Certifying algorithms (Q465678) (← links)
- Bounding the payment of approximate truthful mechanisms (Q476890) (← links)
- A graph theoretic method for determining generating sets of prime ideals in quantum matrices (Q555559) (← links)
- A history of graph entropy measures (Q621629) (← links)
- A comparison of lower bounds for the symmetric circulant traveling salesman problem (Q643021) (← links)
- Graph connectivity and its augmentation: Applications of MA orderings (Q697579) (← links)
- On the maximum size of a minimal \(k\)-edge connected augmentation (Q765200) (← links)
- How to collect balls moving in the Euclidean plane (Q860383) (← links)
- Structure theorem and algorithm on \((1,f)\)-odd subgraph (Q878634) (← links)
- Finding small stabilizers for unstable graphs (Q896265) (← links)
- Changing of the guards: strip cover with duty cycling (Q896691) (← links)
- Query-competitive algorithms for cheapest set problems under uncertainty (Q899309) (← links)
- Approximation algorithms for partially covering with edges (Q930925) (← links)
- The Erdős-Hajnal conjecture for bull-free graphs (Q958690) (← links)
- Using combinatorial optimization in model-based trimmed clustering with cardinality constraints (Q962299) (← links)
- On minimum power connectivity problems (Q972357) (← links)
- Parity and disparity subgraphs (Q1025535) (← links)
- Approximating minimum-power edge-covers and 2,3-connectivity (Q1026146) (← links)
- Weighted coloring on planar, bipartite and split graphs: Complexity and approximation (Q1028481) (← links)
- Using a greedy random adaptative search procedure to solve the cover printing problem (Q1040963) (← links)
- A comparative study of two fast phase unwrapping algorithms. (Q1421258) (← links)
- Edge-disjoint odd cycles in planar graphs. (Q1425111) (← links)
- Monotonizing linear programs with up to two nonzeroes per column (Q1433661) (← links)
- A note on diagonally dominant matrices (Q1587900) (← links)
- Approximation algorithms for multi-parameter graph optimization problems (Q1602708) (← links)
- Partition-distance: A problem and class of perfect graphs arising in clustering (Q1603544) (← links)
- Compact vs. exponential-size LP relaxations (Q1612003) (← links)
- Tractable combinatorial auctions and \(b\)-matching (Q1614868) (← links)
- Extending tournament solutions (Q1616754) (← links)
- The mixed evacuation problem (Q1631682) (← links)
- Exact and heuristic approaches for the cycle hub location problem (Q1686520) (← links)
- Linearly-growing reductions of Karp's 21 NP-complete problems (Q1713202) (← links)
- An exact solution method for quadratic matching: the one-quadratic-term technique and generalisations (Q1751141) (← links)
- Finding a maximum 2-matching excluding prescribed cycles in bipartite graphs (Q1751242) (← links)
- A class of network optimization methods for planar grid generation (Q1763629) (← links)
- Approximation algorithms for some vehicle routing problems (Q1765372) (← links)
- Stabilizing network bargaining games by blocking players (Q1801001) (← links)
- Generalized network design problems. (Q1810478) (← links)
- Team formation: Matching quality supply and quality demand. (Q1810514) (← links)
