The following pages link to Notes—On a Selection Problem (Q5603746):
Displaying 10 items.
- Approximation algorithms for discrete polynomial optimization (Q384206) (← links)
- Dynamic evolution of economically preferred facilities (Q954890) (← links)
- A solution method for the non-additive resource allocation problem in distributed system design (Q1051443) (← links)
- Unimodular functions (Q1079493) (← links)
- Activity optimization games with complementarity (Q1091957) (← links)
- The Boolean quadratic polytope: Some characteristics, facets and relatives (Q1122479) (← links)
- The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds (Q1179735) (← links)
- Boolean polynomials and set functions (Q1310196) (← links)
- Using critical sets to solve the maximum independent set problem (Q2457270) (← links)
- A new?old algorithm for minimum-cut and maximum-flow in closure graphs (Q2744651) (← links)
