Advances and Novel Approaches in Discrete Optimization
Discrete optimization is an important area of Applied Mathematics with a broad spectrum of applications in many fields. This book results from a Special Issue in the journal Mathematics entitled ‘Advances and Novel Approaches in Discrete Optimization’. It contains 17 articles covering a broad spectr...
Saved in:
| Sonstige: | |
|---|---|
| Year of Publication: | 2020 |
| Language: | English |
| Physical Description: | 1 electronic resource (354 p.) |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| id |
993545723404498 |
|---|---|
| ctrlnum |
(CKB)5400000000044672 (oapen)https://directory.doabooks.org/handle/20.500.12854/69200 (EXLCZ)995400000000044672 |
| collection |
bib_alma |
| record_format |
marc |
| spelling |
Werner, Frank edt Advances and Novel Approaches in Discrete Optimization Basel, Switzerland MDPI - Multidisciplinary Digital Publishing Institute 2020 1 electronic resource (354 p.) text txt rdacontent computer c rdamedia online resource cr rdacarrier Open access Unrestricted online access star Discrete optimization is an important area of Applied Mathematics with a broad spectrum of applications in many fields. This book results from a Special Issue in the journal Mathematics entitled ‘Advances and Novel Approaches in Discrete Optimization’. It contains 17 articles covering a broad spectrum of subjects which have been selected from 43 submitted papers after a thorough refereeing process. Among other topics, it includes seven articles dealing with scheduling problems, e.g., online scheduling, batching, dual and inverse scheduling problems, or uncertain scheduling problems. Other subjects are graphs and applications, evacuation planning, the max-cut problem, capacitated lot-sizing, and packing algorithms. English Research & information: general bicssc Mathematics & science bicssc forgotten index balaban index reclassified the zagreb indices ABC4 index GA5 index HDN3(m) THDN3(m) RHDN3(m) degree of vertex extended adjacency index scheduling with rejection machine non-availability operator non-availability dynamic programming FPTAS Transportation batching scheduling total weighted completion time unary NP-hard approximation algorithm bi-criteria scheduling online algorithm makespan maximum machine cost competitive ratio network optimization dynamic flow evacuation planning contraflow configuration partial lane reversals, algorithms and complexity logistic supports scheduling algorithm release-time due-date divisible numbers lateness bin packing time complexity batch scheduling linear deterioration job families Max-cut problem combinatorial optimization deep learning pointer network supervised learning reinforcement learning capacitated lot sizing mixed integer formulation retail inventory shortages graph join product crossing number cyclic permutation arithmetic mean combinatorial generation method algorithm AND/OR tree Euler-Catalan's triangle labeled Dyck path ranking algorithm unranking algorithm Harris hawks optimizer load frequency control sensitivity analysis smart grid particle swarm optimization genetic algorithm meta-heuristics packing irregular 3D objects quasi-phi-function s nonlinear optimization single-machine scheduling minimization of maximum penalty dual problem inverse problem branch and bound LNS numerical conversion RISC FPGA embedded systems scheduling job-shop makespan criterion uncertain processing times 3-03943-222-2 3-03943-223-0 Werner, Frank oth |
| language |
English |
| format |
eBook |
| author2 |
Werner, Frank |
| author_facet |
Werner, Frank |
| author2_variant |
f w fw |
| author2_role |
Sonstige |
| title |
Advances and Novel Approaches in Discrete Optimization |
| spellingShingle |
Advances and Novel Approaches in Discrete Optimization |
| title_full |
Advances and Novel Approaches in Discrete Optimization |
| title_fullStr |
Advances and Novel Approaches in Discrete Optimization |
| title_full_unstemmed |
Advances and Novel Approaches in Discrete Optimization |
| title_auth |
Advances and Novel Approaches in Discrete Optimization |
| title_new |
Advances and Novel Approaches in Discrete Optimization |
| title_sort |
advances and novel approaches in discrete optimization |
| publisher |
MDPI - Multidisciplinary Digital Publishing Institute |
| publishDate |
2020 |
| physical |
1 electronic resource (354 p.) |
| isbn |
3-03943-222-2 3-03943-223-0 |
| illustrated |
Not Illustrated |
| work_keys_str_mv |
AT wernerfrank advancesandnovelapproachesindiscreteoptimization |
| status_str |
n |
| ids_txt_mv |
(CKB)5400000000044672 (oapen)https://directory.doabooks.org/handle/20.500.12854/69200 (EXLCZ)995400000000044672 |
| carrierType_str_mv |
cr |
| is_hierarchy_title |
Advances and Novel Approaches in Discrete Optimization |
| author2_original_writing_str_mv |
noLinkedField |
| _version_ |
1787548867296755712 |
| fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>04780nam-a2201393z--4500</leader><controlfield tag="001">993545723404498</controlfield><controlfield tag="005">20231214133701.0</controlfield><controlfield tag="006">m o d </controlfield><controlfield tag="007">cr|mn|---annan</controlfield><controlfield tag="008">202105s2020 xx |||||o ||| 0|eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(CKB)5400000000044672</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(oapen)https://directory.doabooks.org/handle/20.500.12854/69200</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(EXLCZ)995400000000044672</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Werner, Frank</subfield><subfield code="4">edt</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Advances and Novel Approaches in Discrete Optimization</subfield></datafield><datafield tag="260" ind1=" " ind2=" "><subfield code="a">Basel, Switzerland</subfield><subfield code="b">MDPI - Multidisciplinary Digital Publishing Institute</subfield><subfield code="c">2020</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 electronic resource (354 p.)</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">computer</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">online resource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="506" ind1=" " ind2=" "><subfield code="a">Open access</subfield><subfield code="f">Unrestricted online access</subfield><subfield code="2">star</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Discrete optimization is an important area of Applied Mathematics with a broad spectrum of applications in many fields. This book results from a Special Issue in the journal Mathematics entitled ‘Advances and Novel Approaches in Discrete Optimization’. It contains 17 articles covering a broad spectrum of subjects which have been selected from 43 submitted papers after a thorough refereeing process. Among other topics, it includes seven articles dealing with scheduling problems, e.g., online scheduling, batching, dual and inverse scheduling problems, or uncertain scheduling problems. Other subjects are graphs and applications, evacuation planning, the max-cut problem, capacitated lot-sizing, and packing algorithms.</subfield></datafield><datafield tag="546" ind1=" " ind2=" "><subfield code="a">English</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Research & information: general</subfield><subfield code="2">bicssc</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Mathematics & science</subfield><subfield code="2">bicssc</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">forgotten index</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">balaban index</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">reclassified the zagreb indices</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">ABC4 index</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">GA5 index</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">HDN3(m)</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">THDN3(m)</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">RHDN3(m)</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">degree of vertex</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">extended adjacency index</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">scheduling with rejection</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">machine non-availability</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">operator non-availability</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">dynamic programming</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">FPTAS</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Transportation</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">batching scheduling</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">total weighted completion time</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">unary NP-hard</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">approximation algorithm</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">bi-criteria scheduling</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">online algorithm</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">makespan</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">maximum machine cost</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">competitive ratio</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">network optimization</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">dynamic flow</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">evacuation planning</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">contraflow configuration</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">partial lane reversals, algorithms and complexity</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">logistic supports</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">scheduling algorithm</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">release-time</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">due-date</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">divisible numbers</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">lateness</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">bin packing</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">time complexity</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">batch scheduling</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">linear deterioration</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">job families</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Max-cut problem</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">combinatorial optimization</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">deep learning</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">pointer network</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">supervised learning</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">reinforcement learning</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">capacitated lot sizing</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">mixed integer formulation</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">retail</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">inventory</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">shortages</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">graph</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">join product</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">crossing number</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">cyclic permutation</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">arithmetic mean</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">combinatorial generation</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">method</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">algorithm</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">AND/OR tree</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Euler-Catalan's triangle</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">labeled Dyck path</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">ranking algorithm</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">unranking algorithm</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Harris hawks optimizer</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">load frequency control</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">sensitivity analysis</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">smart grid</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">particle swarm optimization</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">genetic algorithm</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">meta-heuristics</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">packing</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">irregular 3D objects</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">quasi-phi-function s</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">nonlinear optimization</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">single-machine scheduling</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">minimization of maximum penalty</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">dual problem</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">inverse problem</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">branch and bound</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">LNS</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">numerical conversion</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">RISC</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">FPGA</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">embedded systems</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">scheduling</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">job-shop</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">makespan criterion</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">uncertain processing times</subfield></datafield><datafield tag="776" ind1=" " ind2=" "><subfield code="z">3-03943-222-2</subfield></datafield><datafield tag="776" ind1=" " ind2=" "><subfield code="z">3-03943-223-0</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Werner, Frank</subfield><subfield code="4">oth</subfield></datafield><datafield tag="906" ind1=" " ind2=" "><subfield code="a">BOOK</subfield></datafield><datafield tag="ADM" ind1=" " ind2=" "><subfield code="b">2023-12-15 06:02:34 Europe/Vienna</subfield><subfield code="f">system</subfield><subfield code="c">marc21</subfield><subfield code="a">2022-04-04 09:22:53 Europe/Vienna</subfield><subfield code="g">false</subfield></datafield><datafield tag="AVE" ind1=" " ind2=" "><subfield code="i">DOAB Directory of Open Access Books</subfield><subfield code="P">DOAB Directory of Open Access Books</subfield><subfield code="x">https://eu02.alma.exlibrisgroup.com/view/uresolver/43ACC_OEAW/openurl?u.ignore_date_coverage=true&portfolio_pid=5338049610004498&Force_direct=true</subfield><subfield code="Z">5338049610004498</subfield><subfield code="b">Available</subfield><subfield code="8">5338049610004498</subfield></datafield></record></collection> |