找回密碼
 To register

QQ登錄

只需一步,快速開始

掃一掃,訪問微社區(qū)

打印 上一主題 下一主題

Titlebook: Integer Programming and Combinatorial Optimization; 4th International IP Egon Balas,Jens Clausen Conference proceedings 1995 Springer-Verla

[復制鏈接]
樓主: 出租車
51#
發(fā)表于 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
52#
發(fā)表于 2025-3-30 13:53:53 | 只看該作者
53#
發(fā)表于 2025-3-30 17:47:26 | 只看該作者
54#
發(fā)表于 2025-3-30 20:59:05 | 只看該作者
55#
發(fā)表于 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.
56#
發(fā)表于 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.
57#
發(fā)表于 2025-3-31 09:51:09 | 只看該作者
58#
發(fā)表于 2025-3-31 17:16:33 | 只看該作者
Integer Programming and Combinatorial Optimization978-3-540-49245-0Series ISSN 0302-9743 Series E-ISSN 1611-3349
59#
發(fā)表于 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.
60#
發(fā)表于 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 ....
 關于派博傳思  派博傳思旗下網站  友情鏈接
派博傳思介紹 公司地理位置 論文服務流程 影響因子官網 吾愛論文網 大講堂 北京大學 Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點評 投稿經驗總結 SCIENCEGARD IMPACTFACTOR 派博系數 清華大學 Yale Uni. Stanford Uni.
QQ|Archiver|手機版|小黑屋| 派博傳思國際 ( 京公網安備110108008328) GMT+8, 2026-1-23 19:14
Copyright © 2001-2015 派博傳思   京公網安備110108008328 版權所有 All rights reserved
快速回復 返回頂部 返回列表
历史| 信丰县| 蓬莱市| 京山县| 灵丘县| 绥德县| 禹城市| 黔南| 新营市| 宁乡县| 名山县| 延寿县| 乃东县| 浦东新区| 五原县| 淮北市| 江孜县| 缙云县| 疏附县| 青浦区| 仁化县| 庄浪县| 克山县| 平谷区| 库尔勒市| 武功县| 西昌市| 江城| 天祝| 历史| 乌什县| 应用必备| 海宁市| 靖安县| 彰化县| 循化| 宕昌县| 班戈县| 景泰县| 商都县| 霍林郭勒市|