Výsledky vyhledávání - mixed‐integer second‐order one programming (problem* OR problems*)~
-
1
Autoři:
Zdroj: Communications in Combinatorics & Optimization. Dec2025, Vol. 10 Issue 4, p837-875. 39p.
-
2
Autoři: a další
Zdroj: International Journal of Production Research. Aug2025, Vol. 63 Issue 16, p5963-5986. 24p.
-
3
Autoři: a další
Zdroj: International Journal of Production Research. Oct2025, Vol. 63 Issue 20, p7687-7727. 41p.
-
4
-
5
-
6
Autoři:
Zdroj: Electronic Notes in Discrete Mathematics 69 (2018): 45–52. doi:10.1016/j.endm.2018.07.007
info:cnr-pdr/source/autori:Frangioni A.; Galli L.; Stea G./titolo:Towards Robust Admission Control in Delay-Constrained Routing Problems/doi:10.1016%2Fj.endm.2018.07.007/rivista:Electronic Notes in Discrete Mathematics/anno:2018/pagina_da:45/pagina_a:52/intervallo_pagine:45–52/volume:69Témata: Routing problems, maximum delay constraints, scheduling algorithms, admission control, Mixed-Integer NonLinear Programming, Second-Order Cone Programs, Robustness, Routing problems, maximum delay constraints, scheduling algorithms, admission control, Mixed-Integer NonLinear Programming, Second-Order Cone Programs, Robustness, 0211 other engineering and technologies, 0202 electrical engineering, electronic engineering, information engineering, [object Object], 02 engineering and technology, [object Object
Popis souboru: application/pdf
Přístupová URL adresa: https://arpi.unipi.it/bitstream/11568/911954/2/euroalio_ADCR.pdf
https://jglobal.jst.go.jp/detail?JGLOBAL_ID=201802287424781582
https://arpi.unipi.it/bitstream/11568/911954/2/euroalio_ADCR.pdf
https://dblp.uni-trier.de/db/journals/endm/endm69.html#FrangioniGS18
https://www.sciencedirect.com/science/article/pii/S1571065318301513
https://arpi.unipi.it/handle/11568/911954
https://hdl.handle.net/20.500.14243/347552
https://doi.org/10.1016/j.endm.2018.07.007
http://www.scopus.com/inward/record.url?eid=2-s2.0-85051088694&partnerID=q2rCbXpz
https://www.sciencedirect.com/science/article/pii/S1571065318301513
https://doi.org/10.1016/j.endm.2018.07.007
https://hdl.handle.net/11568/911954
https://www.sciencedirect.com/science/article/pii/S1571065318301513
https://doi.org/10.1016/j.endm.2018.07.007
https://hdl.handle.net/11585/1000206 -
7
Profit maximization in congested hub location problems: Demand models and service level constraints.
Autoři:
Zdroj: Transportation Research Part E: Logistics & Transportation Review. Mar2025, Vol. 195, pN.PAG-N.PAG. 1p.
-
8
Autoři: a další
Přispěvatelé: a další
Zdroj: Computers & Operations Research 2023, Vol. 159, pp. 525-553.
Popis souboru: application/pdf
Relation: info:eu-repo/grantAgreement/AEI/Plan Estatal de Investigación Científica y Técnica y de Innovación 2017-2020/PID2020-114594GB-C21/ES/OPTIMIZATION ON DATA SCIENCE AND NETWORK DESIGN PROBLEMS: LARGE SCALE NETWORK MODELS MEET OPTIMIZATION AND DATA SCIENCE TOOLS/; info:eu-repo/grantAgreement/AEI/Plan Estatal de Investigación Científica y Técnica y de Innovación 2017-2020/PID2020-114594GB-C22/ES/OPTIMIZATION ON DATA SCIENCE AND NETWORK DESIGN PROBLEMS: DATA SCIENCE MEETS OPTIMIZATION AND NETWORK MODELS/; info:eu-repo/grantAgreement/AEI/Plan Estatal de Investigación Científica y Técnica y de Innovación 2017-2020/RED2018-102363-T; info:eu-repo/grantAgreement/AEI/Plan Estatal de Investigación Científica y Técnica y de Innovación 2020-2023/TED2021-130875B-I00/ES/Optimización de recursos y de cadenas de producción; http://hdl.handle.net/10498/29911
-
9
Autoři: Murat GÜNGÖR
Zdroj: Volume: 16, Issue: 1 20-29
Uluslararası Mühendislik Araştırma ve Geliştirme Dergisi
International Journal of Engineering Research and DevelopmentTémata: Endüstri Mühendisliği, mixed-integer second-order cone programming, hiperbolik 0-1 programlama, kısmi tam sayılı ikinci mertebeden koni programlama, kesirli 0-1 programlama, kısmi tam sayılı konik karesel programlama, tercihler, fractional 0-1 programming, hyperbolic 0-1 programming, mixed-integer conic quadratic programming, task assignment, preferences, Industrial Engineering, iş atama
Popis souboru: application/pdf
-
10
Autoři:
Zdroj: Optimization and Engineering.
Témata: Optimization and Control (math.OC), FOS: Mathematics, Mathematics - Optimization and Control
Přístupová URL adresa: http://arxiv.org/abs/2306.10810
-
11
Autoři:
Zdroj: Omega. Jul2019, Vol. 86, p16-27. 12p.
-
12
Autoři:
Témata: Facility location, Fair resource allocation, Ordered weighted averaging problem, Mixed integer non linear programming
Relation: V. Blanco and R. Gázquez. Fairness in maximal covering location problems. Computers & Operations Research 157 (2023) 106287 [https://doi.org/10.1016/j.cor.2023.106287]; https://hdl.handle.net/10481/82860
-
13
Autoři:
Zdroj: European Journal of Operational Research. Apr2016, Vol. 250 Issue 1, p56-64. 9p.
-
14
Autoři: a další
Přispěvatelé: a další
Zdroj: Mathematical Programming Computation. 12:249-293
Témata: Optimization and Control (math.OC), FOS: Mathematics, Mathematics - Optimization and Control
Popis souboru: application/pdf
Přístupová URL adresa: http://arxiv.org/pdf/1808.05290
http://arxiv.org/abs/1808.05290
https://link.springer.com/article/10.1007/s12532-020-00178-3
https://doi.org/10.1007/s12532-020-00178-3
https://dblp.uni-trier.de/db/journals/mpc/mpc12.html#CoeyLV20
https://ui.adsabs.harvard.edu/abs/2018arXiv180805290C/abstract
http://doi.org/10.1007/s12532-020-00178-3
https://arxiv.org/pdf/1808.05290.pdf
https://arxiv.org/abs/1808.05290 -
15
Autoři: a další
Zdroj: Computational Optimization & Applications. Nov2022, Vol. 83 Issue 2, p525-553. 29p.
Témata: *INTEGER programming, *PROBLEM solving, *COST, CONVEX domains
-
16
Autoři:
Přispěvatelé:
Zdroj: idUS. Depósito de Investigación de la Universidad de Sevilla
Universidad de Sevilla (US)Popis souboru: application/pdf
Přístupová URL adresa: https://hdl.handle.net/11441/156604
https://idus.us.es/handle//11441/156604 -
17
Autoři: a další
Přispěvatelé: a další
Témata: Combinatorial optimization▼aInteger programming▼aStochastic programming▼aRobust optimization▼aDistributionally robust optimization▼aSecond-order cone program▼aBinary knapsack problem▼aShortest path problem▼aFacility location problem▼aBranch-and-price algorithm, 조합 최적화▼a정수 계획법▼a추계적 계획법▼a강건 최적화▼a분포 강건 최적화▼a2차 원뿔 계획법▼a이진 배낭 문제▼a최단 경로 문제▼a입지 선정 문제▼a분지평가법
Relation: 962548; http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=962548&flag=dissertation; http://hdl.handle.net/10203/294598; 325007; 796
-
18
Autoři:
Zdroj: Journal of Scheduling
Journal of Scheduling, vol 13, iss 1Témata: Optimization, Calculus of Variations and Optimal Control, Parallel machine, Time/cost trade-offs, Parallel programming, Production/Logistics, Artificial Intelligence (incl. Robotics), Controllable processing time, 0211 other engineering and technologies, 02 engineering and technology, Management Science and Operations Research, Controllable processing times, Communication channels (information theory), Fast heuristic algorithms, Artificial Intelligence, Manufacturing cost, Heuristic algorithms, Parallel machine rescheduling, Engineering(all), Efficient frontier, Convex functions, Scheduling problem, Manufacture, Integer programming, Sub-problems, Mixed-Integer Programming, Costs, Second-order cone programming, Processing time, Up time, Match up times, Operations Research/Decision Theory, Economics / Management Science, Software
Popis souboru: application/pdf
Přístupová URL adresa: https://link.springer.com/content/pdf/10.1007%2Fs10951-009-0111-2.pdf
https://escholarship.org/uc/item/1fr3m4kq?view=search
https://escholarship.org/uc/item/1fr3m4kq.pdf
http://ieor.berkeley.edu/~atamturk/pubs/_published/jos-matchup.pdf
https://escholarship.org/uc/item/1fr3m4kq
https://escholarship.org/content/qt1fr3m4kq/qt1fr3m4kq.pdf
https://core.ac.uk/display/81631579
https://hdl.handle.net/11693/22437
https://escholarship.org/uc/item/1fr3m4kq
https://aperta.ulakbim.gov.tr/record/26901 -
19
Autoři: a další
Zdroj: Journal of Machine Learning Research. 2023, Vol. 24, p1-38. 38p.
-
20
Autoři: a další
Zdroj: IET Renewable Power Generation. 13:2673-2683
Témata: 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology
Nájsť tento článok vo Web of Science
Full Text Finder