Entry optimization using mixed integer linear programming
Abstract An appropriate selection of agents to participate in a confrontation such as a game or combat depends on the types of the opposing team. This paper investigates the problem of determining a combination of agents to fight in a combat between two forces. When the types of enemy agents committ...
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
Baek, Seungmin [verfasserIn] |
|---|
| Format: |
E-Artikel |
|---|---|
| Sprache: |
Englisch |
| Erschienen: |
2016 |
|---|
| Schlagwörter: |
|---|
| Anmerkung: |
© Institute of Control, Robotics and Systems and The Korean Institute of Electrical Engineers and Springer-Verlag Berlin Heidelberg 2016 |
|---|
| Übergeordnetes Werk: |
Enthalten in: International Journal of Control, Automation and Systems - Institute of Control, Robotics and Systems and The Korean Institute of Electrical Engineers, 2009, 14(2016), 1 vom: Feb., Seite 282-290 |
|---|---|
| Übergeordnetes Werk: |
volume:14 ; year:2016 ; number:1 ; month:02 ; pages:282-290 |
| Links: |
|---|
| DOI / URN: |
10.1007/s12555-014-0270-6 |
|---|
| Katalog-ID: |
SPR02641287X |
|---|
| LEADER | 01000caa a22002652 4500 | ||
|---|---|---|---|
| 001 | SPR02641287X | ||
| 003 | DE-627 | ||
| 005 | 20230331230306.0 | ||
| 007 | cr uuu---uuuuu | ||
| 008 | 201007s2016 xx |||||o 00| ||eng c | ||
| 024 | 7 | |a 10.1007/s12555-014-0270-6 |2 doi | |
| 035 | |a (DE-627)SPR02641287X | ||
| 035 | |a (SPR)s12555-014-0270-6-e | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 100 | 1 | |a Baek, Seungmin |e verfasserin |4 aut | |
| 245 | 1 | 0 | |a Entry optimization using mixed integer linear programming |
| 264 | 1 | |c 2016 | |
| 336 | |a Text |b txt |2 rdacontent | ||
| 337 | |a Computermedien |b c |2 rdamedia | ||
| 338 | |a Online-Ressource |b cr |2 rdacarrier | ||
| 500 | |a © Institute of Control, Robotics and Systems and The Korean Institute of Electrical Engineers and Springer-Verlag Berlin Heidelberg 2016 | ||
| 520 | |a Abstract An appropriate selection of agents to participate in a confrontation such as a game or combat depends on the types of the opposing team. This paper investigates the problem of determining a combination of agents to fight in a combat between two forces. When the types of enemy agents committed to the combat are not known, game theory provides the best response to the opponent. The entry game is solved by using mixed integer linear programming (MILP) to consider the constraints on resources in a game theoretic approach. Simulations for the examples involving three different sets of military forces are performed using an optimization tool, which demonstrates that the optimal entry is properly selected corresponding to the opposing force. | ||
| 650 | 4 | |a Decision making |7 (dpeaa)DE-He213 | |
| 650 | 4 | |a game theory |7 (dpeaa)DE-He213 | |
| 650 | 4 | |a military operation |7 (dpeaa)DE-He213 | |
| 650 | 4 | |a MILP (mixed integer linear programming) |7 (dpeaa)DE-He213 | |
| 650 | 4 | |a resource allocation |7 (dpeaa)DE-He213 | |
| 700 | 1 | |a Moon, Sungwon |4 aut | |
| 700 | 1 | |a Kim, H. Jin |4 aut | |
| 773 | 0 | 8 | |i Enthalten in |t International Journal of Control, Automation and Systems |d Institute of Control, Robotics and Systems and The Korean Institute of Electrical Engineers, 2009 |g 14(2016), 1 vom: Feb., Seite 282-290 |w (DE-627)SPR026303256 |7 nnns |
| 773 | 1 | 8 | |g volume:14 |g year:2016 |g number:1 |g month:02 |g pages:282-290 |
| 856 | 4 | 0 | |u https://dx.doi.org/10.1007/s12555-014-0270-6 |z lizenzpflichtig |3 Volltext |
| 912 | |a GBV_USEFLAG_A | ||
| 912 | |a SYSFLAG_A | ||
| 912 | |a GBV_SPRINGER | ||
| 912 | |a GBV_ILN_21 | ||
| 912 | |a GBV_ILN_24 | ||
| 912 | |a GBV_ILN_72 | ||
| 912 | |a GBV_ILN_181 | ||
| 912 | |a GBV_ILN_496 | ||
| 912 | |a GBV_ILN_2002 | ||
| 912 | |a GBV_ILN_2003 | ||
| 912 | |a GBV_ILN_2007 | ||
| 912 | |a GBV_ILN_2008 | ||
| 912 | |a GBV_ILN_2009 | ||
| 912 | |a GBV_ILN_2011 | ||
| 912 | |a GBV_ILN_2060 | ||
| 912 | |a GBV_ILN_2470 | ||
| 951 | |a AR | ||
| 952 | |d 14 |j 2016 |e 1 |c 02 |h 282-290 | ||
| author_variant |
s b sb s m sm h j k hj hjk |
|---|---|
| matchkey_str |
baekseungminmoonsungwonkimhjin:2016----:nrotmztouigieitgri |
| hierarchy_sort_str |
2016 |
| publishDate |
2016 |
| allfields |
10.1007/s12555-014-0270-6 doi (DE-627)SPR02641287X (SPR)s12555-014-0270-6-e DE-627 ger DE-627 rakwb eng Baek, Seungmin verfasserin aut Entry optimization using mixed integer linear programming 2016 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier © Institute of Control, Robotics and Systems and The Korean Institute of Electrical Engineers and Springer-Verlag Berlin Heidelberg 2016 Abstract An appropriate selection of agents to participate in a confrontation such as a game or combat depends on the types of the opposing team. This paper investigates the problem of determining a combination of agents to fight in a combat between two forces. When the types of enemy agents committed to the combat are not known, game theory provides the best response to the opponent. The entry game is solved by using mixed integer linear programming (MILP) to consider the constraints on resources in a game theoretic approach. Simulations for the examples involving three different sets of military forces are performed using an optimization tool, which demonstrates that the optimal entry is properly selected corresponding to the opposing force. Decision making (dpeaa)DE-He213 game theory (dpeaa)DE-He213 military operation (dpeaa)DE-He213 MILP (mixed integer linear programming) (dpeaa)DE-He213 resource allocation (dpeaa)DE-He213 Moon, Sungwon aut Kim, H. Jin aut Enthalten in International Journal of Control, Automation and Systems Institute of Control, Robotics and Systems and The Korean Institute of Electrical Engineers, 2009 14(2016), 1 vom: Feb., Seite 282-290 (DE-627)SPR026303256 nnns volume:14 year:2016 number:1 month:02 pages:282-290 https://dx.doi.org/10.1007/s12555-014-0270-6 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_SPRINGER GBV_ILN_21 GBV_ILN_24 GBV_ILN_72 GBV_ILN_181 GBV_ILN_496 GBV_ILN_2002 GBV_ILN_2003 GBV_ILN_2007 GBV_ILN_2008 GBV_ILN_2009 GBV_ILN_2011 GBV_ILN_2060 GBV_ILN_2470 AR 14 2016 1 02 282-290 |
| spelling |
10.1007/s12555-014-0270-6 doi (DE-627)SPR02641287X (SPR)s12555-014-0270-6-e DE-627 ger DE-627 rakwb eng Baek, Seungmin verfasserin aut Entry optimization using mixed integer linear programming 2016 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier © Institute of Control, Robotics and Systems and The Korean Institute of Electrical Engineers and Springer-Verlag Berlin Heidelberg 2016 Abstract An appropriate selection of agents to participate in a confrontation such as a game or combat depends on the types of the opposing team. This paper investigates the problem of determining a combination of agents to fight in a combat between two forces. When the types of enemy agents committed to the combat are not known, game theory provides the best response to the opponent. The entry game is solved by using mixed integer linear programming (MILP) to consider the constraints on resources in a game theoretic approach. Simulations for the examples involving three different sets of military forces are performed using an optimization tool, which demonstrates that the optimal entry is properly selected corresponding to the opposing force. Decision making (dpeaa)DE-He213 game theory (dpeaa)DE-He213 military operation (dpeaa)DE-He213 MILP (mixed integer linear programming) (dpeaa)DE-He213 resource allocation (dpeaa)DE-He213 Moon, Sungwon aut Kim, H. Jin aut Enthalten in International Journal of Control, Automation and Systems Institute of Control, Robotics and Systems and The Korean Institute of Electrical Engineers, 2009 14(2016), 1 vom: Feb., Seite 282-290 (DE-627)SPR026303256 nnns volume:14 year:2016 number:1 month:02 pages:282-290 https://dx.doi.org/10.1007/s12555-014-0270-6 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_SPRINGER GBV_ILN_21 GBV_ILN_24 GBV_ILN_72 GBV_ILN_181 GBV_ILN_496 GBV_ILN_2002 GBV_ILN_2003 GBV_ILN_2007 GBV_ILN_2008 GBV_ILN_2009 GBV_ILN_2011 GBV_ILN_2060 GBV_ILN_2470 AR 14 2016 1 02 282-290 |
| allfields_unstemmed |
10.1007/s12555-014-0270-6 doi (DE-627)SPR02641287X (SPR)s12555-014-0270-6-e DE-627 ger DE-627 rakwb eng Baek, Seungmin verfasserin aut Entry optimization using mixed integer linear programming 2016 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier © Institute of Control, Robotics and Systems and The Korean Institute of Electrical Engineers and Springer-Verlag Berlin Heidelberg 2016 Abstract An appropriate selection of agents to participate in a confrontation such as a game or combat depends on the types of the opposing team. This paper investigates the problem of determining a combination of agents to fight in a combat between two forces. When the types of enemy agents committed to the combat are not known, game theory provides the best response to the opponent. The entry game is solved by using mixed integer linear programming (MILP) to consider the constraints on resources in a game theoretic approach. Simulations for the examples involving three different sets of military forces are performed using an optimization tool, which demonstrates that the optimal entry is properly selected corresponding to the opposing force. Decision making (dpeaa)DE-He213 game theory (dpeaa)DE-He213 military operation (dpeaa)DE-He213 MILP (mixed integer linear programming) (dpeaa)DE-He213 resource allocation (dpeaa)DE-He213 Moon, Sungwon aut Kim, H. Jin aut Enthalten in International Journal of Control, Automation and Systems Institute of Control, Robotics and Systems and The Korean Institute of Electrical Engineers, 2009 14(2016), 1 vom: Feb., Seite 282-290 (DE-627)SPR026303256 nnns volume:14 year:2016 number:1 month:02 pages:282-290 https://dx.doi.org/10.1007/s12555-014-0270-6 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_SPRINGER GBV_ILN_21 GBV_ILN_24 GBV_ILN_72 GBV_ILN_181 GBV_ILN_496 GBV_ILN_2002 GBV_ILN_2003 GBV_ILN_2007 GBV_ILN_2008 GBV_ILN_2009 GBV_ILN_2011 GBV_ILN_2060 GBV_ILN_2470 AR 14 2016 1 02 282-290 |
| allfieldsGer |
10.1007/s12555-014-0270-6 doi (DE-627)SPR02641287X (SPR)s12555-014-0270-6-e DE-627 ger DE-627 rakwb eng Baek, Seungmin verfasserin aut Entry optimization using mixed integer linear programming 2016 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier © Institute of Control, Robotics and Systems and The Korean Institute of Electrical Engineers and Springer-Verlag Berlin Heidelberg 2016 Abstract An appropriate selection of agents to participate in a confrontation such as a game or combat depends on the types of the opposing team. This paper investigates the problem of determining a combination of agents to fight in a combat between two forces. When the types of enemy agents committed to the combat are not known, game theory provides the best response to the opponent. The entry game is solved by using mixed integer linear programming (MILP) to consider the constraints on resources in a game theoretic approach. Simulations for the examples involving three different sets of military forces are performed using an optimization tool, which demonstrates that the optimal entry is properly selected corresponding to the opposing force. Decision making (dpeaa)DE-He213 game theory (dpeaa)DE-He213 military operation (dpeaa)DE-He213 MILP (mixed integer linear programming) (dpeaa)DE-He213 resource allocation (dpeaa)DE-He213 Moon, Sungwon aut Kim, H. Jin aut Enthalten in International Journal of Control, Automation and Systems Institute of Control, Robotics and Systems and The Korean Institute of Electrical Engineers, 2009 14(2016), 1 vom: Feb., Seite 282-290 (DE-627)SPR026303256 nnns volume:14 year:2016 number:1 month:02 pages:282-290 https://dx.doi.org/10.1007/s12555-014-0270-6 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_SPRINGER GBV_ILN_21 GBV_ILN_24 GBV_ILN_72 GBV_ILN_181 GBV_ILN_496 GBV_ILN_2002 GBV_ILN_2003 GBV_ILN_2007 GBV_ILN_2008 GBV_ILN_2009 GBV_ILN_2011 GBV_ILN_2060 GBV_ILN_2470 AR 14 2016 1 02 282-290 |
| allfieldsSound |
10.1007/s12555-014-0270-6 doi (DE-627)SPR02641287X (SPR)s12555-014-0270-6-e DE-627 ger DE-627 rakwb eng Baek, Seungmin verfasserin aut Entry optimization using mixed integer linear programming 2016 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier © Institute of Control, Robotics and Systems and The Korean Institute of Electrical Engineers and Springer-Verlag Berlin Heidelberg 2016 Abstract An appropriate selection of agents to participate in a confrontation such as a game or combat depends on the types of the opposing team. This paper investigates the problem of determining a combination of agents to fight in a combat between two forces. When the types of enemy agents committed to the combat are not known, game theory provides the best response to the opponent. The entry game is solved by using mixed integer linear programming (MILP) to consider the constraints on resources in a game theoretic approach. Simulations for the examples involving three different sets of military forces are performed using an optimization tool, which demonstrates that the optimal entry is properly selected corresponding to the opposing force. Decision making (dpeaa)DE-He213 game theory (dpeaa)DE-He213 military operation (dpeaa)DE-He213 MILP (mixed integer linear programming) (dpeaa)DE-He213 resource allocation (dpeaa)DE-He213 Moon, Sungwon aut Kim, H. Jin aut Enthalten in International Journal of Control, Automation and Systems Institute of Control, Robotics and Systems and The Korean Institute of Electrical Engineers, 2009 14(2016), 1 vom: Feb., Seite 282-290 (DE-627)SPR026303256 nnns volume:14 year:2016 number:1 month:02 pages:282-290 https://dx.doi.org/10.1007/s12555-014-0270-6 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_SPRINGER GBV_ILN_21 GBV_ILN_24 GBV_ILN_72 GBV_ILN_181 GBV_ILN_496 GBV_ILN_2002 GBV_ILN_2003 GBV_ILN_2007 GBV_ILN_2008 GBV_ILN_2009 GBV_ILN_2011 GBV_ILN_2060 GBV_ILN_2470 AR 14 2016 1 02 282-290 |
| language |
English |
| source |
Enthalten in International Journal of Control, Automation and Systems 14(2016), 1 vom: Feb., Seite 282-290 volume:14 year:2016 number:1 month:02 pages:282-290 |
| sourceStr |
Enthalten in International Journal of Control, Automation and Systems 14(2016), 1 vom: Feb., Seite 282-290 volume:14 year:2016 number:1 month:02 pages:282-290 |
| format_phy_str_mv |
Article |
| institution |
findex.gbv.de |
| topic_facet |
Decision making game theory military operation MILP (mixed integer linear programming) resource allocation |
| isfreeaccess_bool |
false |
| container_title |
International Journal of Control, Automation and Systems |
| authorswithroles_txt_mv |
Baek, Seungmin @@aut@@ Moon, Sungwon @@aut@@ Kim, H. Jin @@aut@@ |
| publishDateDaySort_date |
2016-02-01T00:00:00Z |
| hierarchy_top_id |
SPR026303256 |
| id |
SPR02641287X |
| language_de |
englisch |
| fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">SPR02641287X</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230331230306.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">201007s2016 xx |||||o 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s12555-014-0270-6</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)SPR02641287X</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(SPR)s12555-014-0270-6-e</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Baek, Seungmin</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Entry optimization using mixed integer linear programming</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2016</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">Computermedien</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© Institute of Control, Robotics and Systems and The Korean Institute of Electrical Engineers and Springer-Verlag Berlin Heidelberg 2016</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract An appropriate selection of agents to participate in a confrontation such as a game or combat depends on the types of the opposing team. This paper investigates the problem of determining a combination of agents to fight in a combat between two forces. When the types of enemy agents committed to the combat are not known, game theory provides the best response to the opponent. The entry game is solved by using mixed integer linear programming (MILP) to consider the constraints on resources in a game theoretic approach. Simulations for the examples involving three different sets of military forces are performed using an optimization tool, which demonstrates that the optimal entry is properly selected corresponding to the opposing force.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Decision making</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">game theory</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">military operation</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">MILP (mixed integer linear programming)</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">resource allocation</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Moon, Sungwon</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Kim, H. Jin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">International Journal of Control, Automation and Systems</subfield><subfield code="d">Institute of Control, Robotics and Systems and The Korean Institute of Electrical Engineers, 2009</subfield><subfield code="g">14(2016), 1 vom: Feb., Seite 282-290</subfield><subfield code="w">(DE-627)SPR026303256</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:14</subfield><subfield code="g">year:2016</subfield><subfield code="g">number:1</subfield><subfield code="g">month:02</subfield><subfield code="g">pages:282-290</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://dx.doi.org/10.1007/s12555-014-0270-6</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_SPRINGER</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_21</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_24</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_72</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_181</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_496</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2002</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2003</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2007</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2008</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2009</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2011</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2060</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2470</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">14</subfield><subfield code="j">2016</subfield><subfield code="e">1</subfield><subfield code="c">02</subfield><subfield code="h">282-290</subfield></datafield></record></collection>
|
| author |
Baek, Seungmin |
| spellingShingle |
Baek, Seungmin misc Decision making misc game theory misc military operation misc MILP (mixed integer linear programming) misc resource allocation Entry optimization using mixed integer linear programming |
| authorStr |
Baek, Seungmin |
| ppnlink_with_tag_str_mv |
@@773@@(DE-627)SPR026303256 |
| format |
electronic Article |
| delete_txt_mv |
keep |
| author_role |
aut aut aut |
| collection |
springer |
| remote_str |
true |
| illustrated |
Not Illustrated |
| topic_title |
Entry optimization using mixed integer linear programming Decision making (dpeaa)DE-He213 game theory (dpeaa)DE-He213 military operation (dpeaa)DE-He213 MILP (mixed integer linear programming) (dpeaa)DE-He213 resource allocation (dpeaa)DE-He213 |
| topic |
misc Decision making misc game theory misc military operation misc MILP (mixed integer linear programming) misc resource allocation |
| topic_unstemmed |
misc Decision making misc game theory misc military operation misc MILP (mixed integer linear programming) misc resource allocation |
| topic_browse |
misc Decision making misc game theory misc military operation misc MILP (mixed integer linear programming) misc resource allocation |
| format_facet |
Elektronische Aufsätze Aufsätze Elektronische Ressource |
| format_main_str_mv |
Text Zeitschrift/Artikel |
| carriertype_str_mv |
cr |
| hierarchy_parent_title |
International Journal of Control, Automation and Systems |
| hierarchy_parent_id |
SPR026303256 |
| hierarchy_top_title |
International Journal of Control, Automation and Systems |
| isfreeaccess_txt |
false |
| familylinks_str_mv |
(DE-627)SPR026303256 |
| title |
Entry optimization using mixed integer linear programming |
| ctrlnum |
(DE-627)SPR02641287X (SPR)s12555-014-0270-6-e |
| title_full |
Entry optimization using mixed integer linear programming |
| author_sort |
Baek, Seungmin |
| journal |
International Journal of Control, Automation and Systems |
| journalStr |
International Journal of Control, Automation and Systems |
| lang_code |
eng |
| isOA_bool |
false |
| recordtype |
marc |
| publishDateSort |
2016 |
| contenttype_str_mv |
txt |
| container_start_page |
282 |
| author_browse |
Baek, Seungmin Moon, Sungwon Kim, H. Jin |
| container_volume |
14 |
| format_se |
Elektronische Aufsätze |
| author-letter |
Baek, Seungmin |
| doi_str_mv |
10.1007/s12555-014-0270-6 |
| title_sort |
entry optimization using mixed integer linear programming |
| title_auth |
Entry optimization using mixed integer linear programming |
| abstract |
Abstract An appropriate selection of agents to participate in a confrontation such as a game or combat depends on the types of the opposing team. This paper investigates the problem of determining a combination of agents to fight in a combat between two forces. When the types of enemy agents committed to the combat are not known, game theory provides the best response to the opponent. The entry game is solved by using mixed integer linear programming (MILP) to consider the constraints on resources in a game theoretic approach. Simulations for the examples involving three different sets of military forces are performed using an optimization tool, which demonstrates that the optimal entry is properly selected corresponding to the opposing force. © Institute of Control, Robotics and Systems and The Korean Institute of Electrical Engineers and Springer-Verlag Berlin Heidelberg 2016 |
| abstractGer |
Abstract An appropriate selection of agents to participate in a confrontation such as a game or combat depends on the types of the opposing team. This paper investigates the problem of determining a combination of agents to fight in a combat between two forces. When the types of enemy agents committed to the combat are not known, game theory provides the best response to the opponent. The entry game is solved by using mixed integer linear programming (MILP) to consider the constraints on resources in a game theoretic approach. Simulations for the examples involving three different sets of military forces are performed using an optimization tool, which demonstrates that the optimal entry is properly selected corresponding to the opposing force. © Institute of Control, Robotics and Systems and The Korean Institute of Electrical Engineers and Springer-Verlag Berlin Heidelberg 2016 |
| abstract_unstemmed |
Abstract An appropriate selection of agents to participate in a confrontation such as a game or combat depends on the types of the opposing team. This paper investigates the problem of determining a combination of agents to fight in a combat between two forces. When the types of enemy agents committed to the combat are not known, game theory provides the best response to the opponent. The entry game is solved by using mixed integer linear programming (MILP) to consider the constraints on resources in a game theoretic approach. Simulations for the examples involving three different sets of military forces are performed using an optimization tool, which demonstrates that the optimal entry is properly selected corresponding to the opposing force. © Institute of Control, Robotics and Systems and The Korean Institute of Electrical Engineers and Springer-Verlag Berlin Heidelberg 2016 |
| collection_details |
GBV_USEFLAG_A SYSFLAG_A GBV_SPRINGER GBV_ILN_21 GBV_ILN_24 GBV_ILN_72 GBV_ILN_181 GBV_ILN_496 GBV_ILN_2002 GBV_ILN_2003 GBV_ILN_2007 GBV_ILN_2008 GBV_ILN_2009 GBV_ILN_2011 GBV_ILN_2060 GBV_ILN_2470 |
| container_issue |
1 |
| title_short |
Entry optimization using mixed integer linear programming |
| url |
https://dx.doi.org/10.1007/s12555-014-0270-6 |
| remote_bool |
true |
| author2 |
Moon, Sungwon Kim, H. Jin |
| author2Str |
Moon, Sungwon Kim, H. Jin |
| ppnlink |
SPR026303256 |
| mediatype_str_mv |
c |
| isOA_txt |
false |
| hochschulschrift_bool |
false |
| doi_str |
10.1007/s12555-014-0270-6 |
| up_date |
2024-07-03T20:43:11.239Z |
| _version_ |
1803592024716214272 |
| fullrecord_marcxml |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">SPR02641287X</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230331230306.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">201007s2016 xx |||||o 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s12555-014-0270-6</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)SPR02641287X</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(SPR)s12555-014-0270-6-e</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Baek, Seungmin</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Entry optimization using mixed integer linear programming</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2016</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">Computermedien</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© Institute of Control, Robotics and Systems and The Korean Institute of Electrical Engineers and Springer-Verlag Berlin Heidelberg 2016</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract An appropriate selection of agents to participate in a confrontation such as a game or combat depends on the types of the opposing team. This paper investigates the problem of determining a combination of agents to fight in a combat between two forces. When the types of enemy agents committed to the combat are not known, game theory provides the best response to the opponent. The entry game is solved by using mixed integer linear programming (MILP) to consider the constraints on resources in a game theoretic approach. Simulations for the examples involving three different sets of military forces are performed using an optimization tool, which demonstrates that the optimal entry is properly selected corresponding to the opposing force.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Decision making</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">game theory</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">military operation</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">MILP (mixed integer linear programming)</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">resource allocation</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Moon, Sungwon</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Kim, H. Jin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">International Journal of Control, Automation and Systems</subfield><subfield code="d">Institute of Control, Robotics and Systems and The Korean Institute of Electrical Engineers, 2009</subfield><subfield code="g">14(2016), 1 vom: Feb., Seite 282-290</subfield><subfield code="w">(DE-627)SPR026303256</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:14</subfield><subfield code="g">year:2016</subfield><subfield code="g">number:1</subfield><subfield code="g">month:02</subfield><subfield code="g">pages:282-290</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://dx.doi.org/10.1007/s12555-014-0270-6</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_SPRINGER</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_21</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_24</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_72</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_181</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_496</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2002</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2003</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2007</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2008</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2009</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2011</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2060</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2470</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">14</subfield><subfield code="j">2016</subfield><subfield code="e">1</subfield><subfield code="c">02</subfield><subfield code="h">282-290</subfield></datafield></record></collection>
|
| score |
7.4008074 |