找回密碼
 To register

QQ登錄

只需一步，快速開始

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

打印 上一主題 下一主題

Titlebook: Compact Extended Linear Programming Models; Giuseppe Lancia,Paolo Serafini Textbook 2018 Springer International Publishing AG 2018 ILP.com

[復(fù)制鏈接]
查看: 49931|回復(fù): 52
樓主
發(fā)表于 2025-3-21 16:53:15 | 只看該作者 |倒序瀏覽 |閱讀模式
書目名稱Compact Extended Linear Programming Models
編輯Giuseppe Lancia,Paolo Serafini
視頻videohttp://file.papertrans.cn/231/230781/230781.mp4
概述Presents, perhaps for the first time, the theory of compact extended ILP models in the most general and didactic form possible.Provides a compact yet comprehensive introduction into exponential-size i
叢書名稱EURO Advanced Tutorials on Operational Research
圖書封面Titlebook: Compact Extended Linear Programming Models; Giuseppe Lancia,Paolo Serafini Textbook 2018 Springer International Publishing AG 2018 ILP.com
描述This book provides a handy, unified introduction to the theory of compact extended formulations of exponential-size integer linear programming (ILP) models. Compact extended formulations are equally powerful, but polynomial-sized, models whose solutions do not require the implementation of separation and pricing procedures. The book is written in a general, didactic form, first developing the background theoretical concepts (polyhedra, projections, linear and integer programming) and then delving into the various techniques for compact extended reformulations. The techniques are illustrated through a wealth of examples touching on many application areas, such as classical combinatorial optimization, network design, timetabling, scheduling, routing, computational biology and bioinformatics. The book is intended for graduate or PhD students – either as an advanced course on selected topics or within a more general course on ILP and mathematical programming – as well as for practitionersand software engineers in industry exploring techniques for developing optimization models for their specific problems.?
出版日期Textbook 2018
關(guān)鍵詞ILP; combinatorial optimization; branch-and-cut; compact extended formulations; max-cut; bin packing; cutt
版次1
doihttps://doi.org/10.1007/978-3-319-63976-5
isbn_softcover978-3-319-87687-0
isbn_ebook978-3-319-63976-5Series ISSN 2364-687X Series E-ISSN 2364-6888
issn_series 2364-687X
copyrightSpringer International Publishing AG 2018
The information of publication is updating

書目名稱Compact Extended Linear Programming Models影響因子(影響力)




書目名稱Compact Extended Linear Programming Models影響因子(影響力)學科排名




書目名稱Compact Extended Linear Programming Models網(wǎng)絡(luò)公開度




書目名稱Compact Extended Linear Programming Models網(wǎng)絡(luò)公開度學科排名




書目名稱Compact Extended Linear Programming Models被引頻次




書目名稱Compact Extended Linear Programming Models被引頻次學科排名




書目名稱Compact Extended Linear Programming Models年度引用




書目名稱Compact Extended Linear Programming Models年度引用學科排名




書目名稱Compact Extended Linear Programming Models讀者反饋




書目名稱Compact Extended Linear Programming Models讀者反饋學科排名




單選投票, 共有 1 人參與投票
 

0票 0.00%

Perfect with Aesthetics
 

0票 0.00%

Better Implies Difficulty
 

1票 100.00%

Good and Satisfactory
 

0票 0.00%

Adverse Performance
 

0票 0.00%

Disdainful Garbage
您所在的用戶組沒有投票權(quán)限
沙發(fā)
發(fā)表于 2025-3-21 21:43:12 | 只看該作者
板凳
發(fā)表于 2025-3-22 02:18:13 | 只看該作者
地板
發(fā)表于 2025-3-22 05:34:57 | 只看該作者
978-3-319-87687-0Springer International Publishing AG 2018
5#
發(fā)表于 2025-3-22 09:17:46 | 只看該作者
Soziale Bewegungen in der Gegenwart,This chapter provides an introduction to Linear Programming theory. It discusses classical concepts such as duality, complementarity slackness, complexity and algorithmic issues.
6#
發(fā)表于 2025-3-22 15:51:45 | 只看該作者
,Nach den ?neuen“ sozialen Bewegungen?,This chapter describes ILP models of exponential-size, either in the number of constraints, the number of variables, or both. These are the models for which compact extended formulations are intended. The separation and pricing problems are introduced as a general paradigm for the solution of such large models.
7#
發(fā)表于 2025-3-22 20:05:00 | 只看該作者
Diana Franke-Meyer,Carola KuhlmannIn this chapter we compare three popular models for the maximum cut problem and show the equivalence of their relaxations by using compact extended formulations. These problems are closely related to the subject of edge-induced and node-induced bipartite subgraphs, for which we give compact extended formulations as well.
8#
發(fā)表于 2025-3-22 23:11:06 | 只看該作者
Linear Programming,This chapter provides an introduction to Linear Programming theory. It discusses classical concepts such as duality, complementarity slackness, complexity and algorithmic issues.
9#
發(fā)表于 2025-3-23 01:34:16 | 只看該作者
10#
發(fā)表于 2025-3-23 06:31:38 | 只看該作者
Cuts and Induced Bipartite Subgraphs,In this chapter we compare three popular models for the maximum cut problem and show the equivalence of their relaxations by using compact extended formulations. These problems are closely related to the subject of edge-induced and node-induced bipartite subgraphs, for which we give compact extended formulations as well.
 關(guān)于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務(wù)流程 影響因子官網(wǎng) 吾愛論文網(wǎng) 大講堂 北京大學 Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點評 投稿經(jīng)驗總結(jié) SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學 Yale Uni. Stanford Uni.
QQ|Archiver|手機版|小黑屋| 派博傳思國際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-8 08:30
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
凤庆县| 城固县| 临潭县| 江达县| 双桥区| 泾川县| 辰溪县| 明水县| 汉源县| 黄陵县| 固安县| 南昌市| 永新县| 康定县| 鹤岗市| 丰镇市| 那曲县| 廉江市| 惠安县| 太原市| 宜城市| 阜宁县| 永靖县| 成武县| 吉林市| 江孜县| 祁东县| 冀州市| 长丰县| 仁怀市| 综艺| 彰武县| 京山县| 安陆市| 绵阳市| 元谋县| 元阳县| 南岸区| 潮安县| 山东省| 安平县|