grenade
发表于 2025-3-30 09:57:57
Oriented matroid polytopes and polyhedral fans are signable,ger classes of . and . are also shellable. In this article we show in a unified way that both classes posses the somewhat weaker property of .. In particular, this allows us to conclude that . oriented matroid polytopes and fans are ., and to prove they satisfy McMullen‘s upper bound theorem on the
砍伐
发表于 2025-3-30 13:53:53
http://reply.papertrans.cn/47/4683/468244/468244_52.png
faculty
发表于 2025-3-30 17:47:26
http://reply.papertrans.cn/47/4683/468244/468244_53.png
步履蹒跚
发表于 2025-3-30 20:59:05
http://reply.papertrans.cn/47/4683/468244/468244_54.png
BLA
发表于 2025-3-31 04:22:45
Combining semidefinite and polyhedral relaxations for integer programs, cut-polytope can be used to strengthen these relaxations. As examples we improve the ϑ-function and give a semidefinite relaxation for the quadratic knapsack problem. The practical value of this approach is supported by numerical experiments which make use of the recent development of efficient interior point codes for semidefinite programming.
medieval
发表于 2025-3-31 08:13:34
On implementing push-relabel method for the maximum flow problem,d much faster on some problem families. The speedup is due to the combination of heuristics used in our implementations. We also exhibit a family of problems for which the running time of all known methods seem to have a roughly quadratic growth rate.
FLUSH
发表于 2025-3-31 09:51:09
http://reply.papertrans.cn/47/4683/468244/468244_57.png
南极
发表于 2025-3-31 17:16:33
Integer Programming and Combinatorial Optimization978-3-540-49245-0Series ISSN 0302-9743 Series E-ISSN 1611-3349
Delude
发表于 2025-3-31 19:10:31
Computational study of a family of mixed-integer quadratic programming problems,We present computational experience with a branch-and-cut algorithm to solve quadratic programming problems where there is an upper bound on the number of positive variables. Such problems arise in financial applications. The algorithm solves the largest real-life problems in a few minutes of run-time.
圆锥体
发表于 2025-3-31 22:54:29
The topological structure of maximal lattice free convex bodies: The general case,Given a generic . matrix ., the simplicial complex . is defined to be the collection of simplices representing maximal lattice point free convex bodies of the form .. The main result of this paper is that the topological space associated with . is homeo-morphic with ....