Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Combinatorial optimization
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
==Applications== Basic applications of combinatorial optimization include, but are not limited to: * [[Logistics]]<ref>{{cite journal|doi=10.1007/s10288-007-0047-3|title=Combinatorial optimization and Green Logistics|journal=4OR|volume=5|issue=2|pages=99–116|year=2007|last1=Sbihi|first1=Abdelkader|last2=Eglese|first2=Richard W.|s2cid=207070217|url=https://hal.archives-ouvertes.fr/hal-00644076/file/COGL_4or.pdf|access-date=2019-12-26|archive-date=2019-12-26|archive-url=https://web.archive.org/web/20191226162210/https://hal.archives-ouvertes.fr/hal-00644076/file/COGL_4or.pdf|url-status=live}}</ref> * [[Supply chain optimization]]<ref>{{cite journal|doi=10.1016/j.omega.2015.01.006|title=Sustainable supply chain network design: An optimization-oriented review|journal=Omega|volume=54|pages=11–32|year=2015|last1=Eskandarpour|first1=Majid|last2=Dejax|first2=Pierre|last3=Miemczyk|first3=Joe|last4=Péton|first4=Olivier|url=https://hal.archives-ouvertes.fr/hal-01154605/file/eskandarpour-et-al%20review%20R2.pdf|access-date=2019-12-26|archive-date=2019-12-26|archive-url=https://web.archive.org/web/20191226162207/https://hal.archives-ouvertes.fr/hal-01154605/file/eskandarpour-et-al%2520review%2520R2.pdf|url-status=live}}</ref> * Developing the best airline network of spokes and destinations * Deciding which taxis in a fleet to route to pick up fares * Determining the optimal way to deliver packages * Allocating jobs to people optimally * Designing water distribution networks * [[Earth science]] problems (e.g. [[reservoir]] flow-rates)<ref>{{cite journal|doi=10.1016/j.advwatres.2018.10.002|title=Estimating fluid flow rates through fracture networks using combinatorial optimization|journal=Advances in Water Resources|year=2018|last1=Hobé|first1=Alex|last2=Vogler|first2=Daniel|last3=Seybold|first3=Martin P.|last4=Ebigbo|first4=Anozie|last5=Settgast|first5=Randolph R.|last6=Saar|first6=Martin O.|volume=122|pages=85–97|url=https://www.sciencedirect.com/science/article/abs/pii/S0309170818300666|arxiv=1801.08321|bibcode=2018AdWR..122...85H|s2cid=119476042|access-date=2020-09-16|archive-date=2020-08-21|archive-url=https://web.archive.org/web/20200821114559/https://www.sciencedirect.com/science/article/abs/pii/S0309170818300666|url-status=live}}</ref>
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)