東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Solving network design problems via ...

Barmann, Andreas.

FindBook

Google Book

Amazon

博客來

Solving network design problems via decomposition, aggregation and approximation

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Solving network design problems via decomposition, aggregation and approximation/ by Andreas Barmann.
作者:	Barmann, Andreas.
出版者:	Wiesbaden :Springer Fachmedien Wiesbaden : : 2016.,
面頁冊數:	xv, 203 p. :ill.(some color), digital ;24 cm.
內容註:	Decomposition for Multi-Period Network Design -- Solving Network Design Problems via Aggregation -- Approximate Second-Order Cone Robust Optimization.
Contained By:	Springer eBooks
標題:	Combinatorial optimization. -
電子資源:	http://dx.doi.org/10.1007/978-3-658-13913-1
ISBN:	9783658139131

Solving network design problems via decomposition, aggregation and approximation
Barmann, Andreas.

Solving network design problems via decomposition, aggregation and approximation[electronic resource] /by Andreas Barmann. - Wiesbaden :Springer Fachmedien Wiesbaden :2016. - xv, 203 p. :ill.(some color), digital ;24 cm.

Decomposition for Multi-Period Network Design -- Solving Network Design Problems via Aggregation -- Approximate Second-Order Cone Robust Optimization.

ISBN: 9783658139131

Standard No.: 10.1007/978-3-658-13913-1doiSubjects--Topical Terms:

544215
Combinatorial optimization.

LC Class. No.: QA402.5

Dewey Class. No.: 519.64

Solving network design problems via decomposition, aggregation and approximation
LDR:01111nmm a2200301 a 4500 001 2041585
003 DE-He213
005 20161130142129.0
006 m d
007 cr nn 008maaau
008 170118s2016 gw s 0 eng d
020 $a 9783658139131 $q (electronic bk.)
020 $a 9783658139124 $q (paper)
024 7 $a 10.1007/978-3-658-13913-1 $2 doi
035 $a 978-3-658-13913-1
040 $a GP $c GP
041 0 $a eng
050 4 $a QA402.5
072 7 $a PBU $2 bicssc
072 7 $a MAT003000 $2 bisacsh
082 0 4 $a 519.64 $2 23
090 $a QA402.5 $b .B258 2016
100 1 $a Barmann, Andreas. $3 2200301
245 1 0 $a Solving network design problems via decomposition, aggregation and approximation $h [electronic resource] / $c by Andreas Barmann.
260 $a Wiesbaden : $b Springer Fachmedien Wiesbaden : $b Imprint: Springer Spektrum, $c 2016.
300 $a xv, 203 p. : $b ill.(some color), digital ; $c 24 cm.
505 0 $a Decomposition for Multi-Period Network Design -- Solving Network Design Problems via Aggregation -- Approximate Second-Order Cone Robust Optimization.
650 0 $a Combinatorial optimization. $3 544215
650 1 4 $a Mathematics. $3 515831
650 2 4 $a Optimization. $3 891104
650 2 4 $a Operation Research/Decision Theory. $3 1620900
650 2 4 $a Logistics. $3 783981
710 2 $a SpringerLink (Online service) $3 836513
773 0 $t Springer eBooks
856 4 0 $u http://dx.doi.org/10.1007/978-3-658-13913-1
950 $a Mathematics and Statistics (Springer-11649)