| 000 | 02889cam a2200637Ia 4500 | ||
|---|---|---|---|
| 001 | ocn883892138 | ||
| 003 | OCoLC | ||
| 005 | 20220701010950.0 | ||
| 006 | m o d | ||
| 007 | cr cnu---unuuu | ||
| 008 | 140718s2014 enk ob 001 0 eng d | ||
| 040 |
_aIDEBK _beng _epn _cIDEBK _dEBLCP _dDG1 _dE7B _dN$T _dMHW _dYDXCP _dDEBSZ _dOCLCQ _dCDX _dOCLCF _dCOO _dOCLCO _dDEBBG _dOCLCQ |
||
| 020 |
_a9781118966471 _q(electronic bk.) |
||
| 020 |
_a1118966473 _q(electronic bk.) |
||
| 020 |
_a9781118966464 _q(electronic bk.) |
||
| 020 |
_a1118966465 _q(electronic bk.) |
||
| 020 |
_a1306958296 _q(electronic bk.) |
||
| 020 |
_a9781306958295 _q(electronic bk.) |
||
| 020 | _a9781848216860 | ||
| 020 | _a1848216866 | ||
| 029 | 1 |
_aAU@ _b000053548406 |
|
| 029 | 1 |
_aCHBIS _b010442154 |
|
| 029 | 1 |
_aCHVBK _b334091713 |
|
| 029 | 1 |
_aDEBBG _bBV042987669 |
|
| 029 | 1 |
_aDEBBG _bBV043396975 |
|
| 029 | 1 |
_aDEBBG _bBV043610945 |
|
| 029 | 1 |
_aDEBSZ _b410562122 |
|
| 029 | 1 |
_aDEBSZ _b468874402 |
|
| 029 | 1 |
_aNZ1 _b15753497 |
|
| 035 | _a(OCoLC)883892138 | ||
| 050 | 4 | _aT57.7 | |
| 072 | 7 |
_aMAT _x003000 _2bisacsh |
|
| 072 | 7 |
_aMAT _x029000 _2bisacsh |
|
| 082 | 0 | 4 |
_a519.7 _222 |
| 049 | _aMAIN | ||
| 245 | 0 | 0 |
_aMathematical programming solver based on local search / _cFrédéric Gardi [and others]. |
| 260 |
_aLondon : _bISTE Ltd. ; _aHoboken : _bWiley, _c©2014. |
||
| 300 | _a1 online resource. | ||
| 336 |
_atext _btxt _2rdacontent |
||
| 337 |
_acomputer _bc _2rdamedia |
||
| 338 |
_aonline resource _bcr _2rdacarrier |
||
| 490 | 1 |
_aFocus Computer Engineering Series, _x2051-249X |
|
| 504 | _aIncludes bibliographical references and index. | ||
| 588 | 0 | _aPrint version record. | |
| 520 | _aThis book covers local search for combinatorial optimization and its extension to mixed-variable optimization. Although not yet understood from the theoretical point of view, local search is the paradigm of choice for tackling large-scale real-life optimization problems. Today's end-users demand interactivity with decision support systems. For optimization software, this means obtaining good-quality solutions quickly. Fast iterative improvement methods, like local search, are suited to satisfying such needs. Here the authors show local search in a new light, in particular presenting a new kin. | ||
| 650 | 0 | _aMathematical optimization. | |
| 650 | 7 |
_aMATHEMATICS _xApplied. _2bisacsh |
|
| 650 | 7 |
_aMATHEMATICS _xProbability & Statistics _xGeneral. _2bisacsh |
|
| 650 | 7 |
_aMathematical optimization. _2fast _0(OCoLC)fst01012099 |
|
| 655 | 4 | _aElectronic books. | |
| 700 | 1 | _aGardi, Frédéric. | |
| 776 | 0 | 8 |
_iPrint version: _tMathematical programming solver based on local search. _dLondon : ISTE Ltd. ; Hoboken : Wiley, ©2014 _z9781118966464 |
| 830 | 0 | _aFocus series in computer engineering. | |
| 856 | 4 | 0 |
_uhttp://dx.doi.org/10.1002/9781118966464 _zWiley Online Library |
| 994 |
_a92 _bDG1 |
||
| 999 |
_c21562 _d21521 |
||