The following pages link to (Q3737235):
Displaying 13 items.
- On simple combinatorial optimization problems. A collection of contributions in honour of Jack van Lint (Q687374) (← links)
- On performance of greedy algorithms (Q719355) (← links)
- Greedy concepts for network flow problems (Q1088884) (← links)
- Strong unimodularity for matrices and hypergraphs (Q1104339) (← links)
- Trapezoid graphs and their coloring (Q1111577) (← links)
- Series parallel composition of greedy linear programming problem (Q1321658) (← links)
- Permuting matrices to avoid forbidden submatrices (Q1894366) (← links)
- Perspectives of Monge properties in optimization (Q1923588) (← links)
- On the power of random greedy algorithms (Q2145759) (← links)
- A ranking model for the greedy algorithm and discrete convexity (Q2429474) (← links)
- Greedy algorithms and Zipf laws (Q4964565) (← links)
- Technical Note—A Monge Sequence-Based Approach to Characterize the Competitive Newsvendor Problem (Q5080644) (← links)
- On supmodular matrices (Q6618722) (← links)