Convex matroid optimization

SIAM Journal on Discrete Mathematics

Volumn 17, Issue 2, 2003, Pages 249-253

  Onn, Shmuel ^a,b  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Cluster; Combinatorial optimization; Convex; Greedy algorithm; Matroid; Optimization; Partition; Polynomial time; Polytope; Quadratic assignment; Strongly polynomial time

Indexed keywords

COMBINATORIAL OPTIMIZATION; CONVEX FUNCTIONALS; GREEDY ALGORITHMS; PARTITION; POLYNOMIAL TIME; POLYTOPES; QUADRATIC ASSIGNMENT; STRONGLY POLYNOMIAL TIMES;

ALGORITHMS; COMPUTATIONAL COMPLEXITY; POLYNOMIALS; PROBLEM SOLVING; QUADRATIC PROGRAMMING; SET THEORY; VECTORS;

MATRIX ALGEBRA;

EID: 2542470893     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895480102408559     Document Type: Article

References (11)

1. N. ALON AND S. ONN, Separable partitions, Discrete Appl. Math., 91 (1999), pp. 39-51.
2. S. AVIRAN AND S. ONN, Momentopes and the vertex complexity of partition polytopes, Discrete Comput. Geom., 27 (2002), pp. 409-417.
3. K. ALLEMAND, K. FUKUDA, T. M. LIEBLING, AND E. STEINER, A polynomial case of unconstrained zero-one quadratic optimization, Math. Program., 91 (2001), pp. 49-52.
4. W. J. COOK, W. H. CUNNINGHAM, W. R. PULLEYBLANK, AND A. SCHRIJVER, Combinatorial Optimization, John Wiley, New York, 1997.
5. H. EDELSBRUNNER, J. O'ROURKE, AND R. SEIDEL, Constructing arrangements of lines and hyperplanes with applications, SIAM J. Comput., 15 (1986), pp. 341-363.
6. H. EDELSBRUNNER, R. SEIDEL, AND M. SHARIR, On the zone theorem for hyperplane arrangements, in New Results and Trends in Computer Science, Lecture Notes in Comput. Sci. 555, Springer, Berlin, 1991, pp. 108-123.
7. P. GRITZMANN AND B. STURMFELS, Minkowski addition of poly topes: Complexity and applications to Gröbner bases, SIAM J. Discrete Math., 6 (1993), pp. 246-269.
8. L. P. HAMMER, P. HANSEN, P. M. PARDALOS, AND D. J. RADER, Maximizing the Product of Two Linear Functions in 0 - 1 Variables, RUTCOR research report 2-97, Rutgers University, Piscataway, NJ, 1997.
9. E. F. HARDING, The number of partitions of a set of n points in k dimensions induced by hyperplanes, Proc. Edinburgh Math. Soc. (2), 15 (1966/1967), pp. 285-289.
10. F. K. HWANG, S. ONN, AND U. G. ROTHBLUM, A polynomial time algorithm for shaped partition problems, SIAM J. Optim., 10 (1999), pp. 70-81.
11. S. ONN AND L. J. SCHULMAN, The vector partition problem for convex objective functions, Math. Oper. Res., 26 (2001), pp. 583-590.