Suchergebnisse - "CUT ALGORITHM"

MUSE-BB: a decomposition algorithm for nonconvex two-stage problems using strong multisection branching

Autoren: Marco Langiu Manuel Dahmen Dominik Bongartz et al.

Quelle: Journal of global optimization 92, 837-888 (2025). doi:10.1007/s10898-025-01489-2
Journal of global optimization 92(4), 837-888 (2025). doi:10.1007/s10898-025-01489-2

Schlagwörter: Technology, Operations Research, Two-stage stochastic programming, Mathematics, Applied, STOCHASTIC PROGRAMS, Clustering, Convergence analysis, GENERALIZED BENDERS DECOMPOSITION, 0102 Applied Mathematics, 4901 Applied mathematics, GLOBAL OPTIMIZATION, CLUSTER PROBLEM, 0802 Computation Theory and Mathematics, INTEGER NONLINEAR PROGRAMS, Decomposition, Science & Technology, 4602 Artificial intelligence, Operations Research & Management Science, 0103 Numerical and Computational Mathematics, CUT ALGORITHM, Physical Sciences, 4903 Numerical and computational mathematics, Multisection, Mathematics

Zugangs-URL: https://juser.fz-juelich.de/record/1044195
https://publications.rwth-aachen.de/record/1010843

Truck‐Drone Pickup and Delivery Service Optimization With Availability Profiles: Truck-drone pickup and delivery service optimization with availability profiles

Autoren: Yunqiang Yin Dongwei Li Dujuan Wang et al.

Quelle: Naval Research Logistics (NRL). 72:534-565

Schlagwörter: transportation, truck-drone routing, Combinatorial optimization, Transportation, logistics and supply chain management, branch-and-price-and-cut algorithm, pickup and delivery problem, 0502 economics and business, 05 social sciences, 0211 other engineering and technologies, 02 engineering and technology

Dateibeschreibung: application/xml

Zugangs-URL: https://zbmath.org/8037540
https://doi.org/10.1002/nav.22238

The Hamiltonian p-median problem: Polyhedral results and branch-and-cut algorithms

Autoren: Michele Barbato Luís Gouveia

Quelle: European Journal of Operational Research. 316:473-487

Schlagwörter: Combinatorial optimization, Hamiltonian p-median problem, Valid inequality, Polyhedral study, Branch-and-cut algorithm

Dateibeschreibung: application/pdf

A Numerically Exact Algorithm for the Bin-Packing Problem

Autoren: Roberto Baldacci Stefano Coniglio Jean-François Cordeau et al.

Quelle: INFORMS Journal on Computing. 36:141-162

Schlagwörter: bin packing, branch-price-and-cut algorithm, dynamic programming, numerical precision, bin packing • numerical precision • branch-price-and-cut algorithm • dynamic programming, 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, Bin packing, 01 natural sciences

Dateibeschreibung: application/pdf

Zugangs-URL: https://hdl.handle.net/10446/257829
https://doi.org/10.1287/ijoc.2022.0257
https://hdl.handle.net/11573/1706930
https://doi.org/10.1287/ijoc.2022.0257
https://hdl.handle.net/11585/1006590
https://doi.org/10.1287/ijoc.2022.0257

Discrete cutting path problems: a general solution framework and industrial applications

Autoren: Khachai, D. Battaia, O. Petunin, A. et al.

Weitere Verfasser: Khachai, D. Battaia, O. Petunin, A. et al.

Quelle: International Journal of Production Research. 63:949-969

Schlagwörter: generalised travelling, adaptive large, neighbourhood search, industry, Cutting path problem, salesman problem, innovation and, endpoint cutting problem, branch-and-cut algorithm, [SHS] Humanities and Social Sciences, infrastructure, precedence constrained

Exact methods for the longest induced cycle problem

Autoren: Anaqreh, Ahmad Turki G.-Tóth, Boglárka Vinkó, Tamás

Quelle: Croatian Operational Research Review, Vol 15, Iss 2, Pp 199-212 (2024)
Croatian Operational Research Review
Volume 15
Issue 2

Schlagwörter: FOS: Computer and information sciences, T57-57.97, Applied mathematics. Quantitative methods, Discrete Mathematics (cs.DM), longest chordless cycle, branch-and-cut algorithm, 01.02. Számítás- és információtudomány, valid inequalities, mixed integer linear programming, longest induced cycle, Computer Science - Discrete Mathematics

Dateibeschreibung: text; application/pdf

Zugangs-URL: http://arxiv.org/abs/2311.15899
https://doaj.org/article/30f87a58caa442b399080dbad409015d
https://hrcak.srce.hr/file/464230
https://doi.org/10.17535/crorr.2024.0016
https://hrcak.srce.hr/321261

SPATIAL PARTITION FOR HETEROGENEOUS CITY NETWORKS COMPOSED OF FACTORS THAT INFLUENCE THE DISTRIBUTION OF THE MACROSCOPIC FUNDAMENTAL DIAGRAM

Autoren: Ding, Heng Yuan, Hanyu Zheng, Xiaoyan et al.

Quelle: Transport, Vol 38, Iss 3 (2023)
Transport; Vol 38 No 3 (2023); 152–164

Schlagwörter: sub-region partition, Transportation engineering, TA1001-1280, macroscopic fundamental diagram, 11. Sustainability, 0502 economics and business, 05 social sciences, normalised cut algorithm, 0211 other engineering and technologies, 02 engineering and technology, minimum spanning tree, partition control

Dateibeschreibung: application/pdf

Zugangs-URL: https://doaj.org/article/bd43d91c573a49ff9ffbe8c1e855cd5c
https://journals.vilniustech.lt/index.php/Transport/article/view/20424

Beyond symmetry: best submatrix selection for the sparse truncated SVD

Autoren: Yongchun Li Weijun Xie

Quelle: Mathematical Programming. 208:1-50

Schlagwörter: Combinatorial optimization, sparse truncated SVD, 0211 other engineering and technologies, 02 engineering and technology, 01 natural sciences, Mixed integer programming, Optimization and Control (math.OC), FOS: Mathematics, Semidefinite programming, branch-and-cut algorithm, row-sparse PCA, 0101 mathematics, approximation algorithms, Mathematics - Optimization and Control, mixed integer semidefinite program

Dateibeschreibung: application/xml

Zugangs-URL: http://arxiv.org/abs/2105.03179

GCphase: an SNP phasing method using a graph partition and error correction algorithm

Autoren: Junwei Luo Jiayi Wang Haixia Zhai et al.

Quelle: BMC Bioinformatics, Vol 25, Iss 1, Pp 1-14 (2024)

Schlagwörter: Haplotype assembly, SNP phasing, Graph minimum-cut algorithm, Error correction, Computer applications to medicine. Medical informatics, R858-859.7, Biology (General), QH301-705.5

Dateibeschreibung: electronic resource

Relation: https://doaj.org/toc/1471-2105

Zugangs-URL: https://doaj.org/article/615f80da87744b40aefbb4b2fefe997c

A branch-and-price-and-cut algorithm for the vehicle routing problem with load-dependent drones

Autoren: Yang Xia Wenjia Zeng Canrong Zhang et al.

Quelle: Transportation Research Part B: Methodological. 171:80-110

Schlagwörter: Vehicle routing problem with load-dependent drones, Nonlinear energy function, Docking hubs, 0502 economics and business, 05 social sciences, 0211 other engineering and technologies, 02 engineering and technology, Branch-and-price-and-cut algorithm, 7. Clean energy

Models and algorithms for the Weighted Safe Set Problem

Autoren: Malaguti, Enrico Pedrotti, Vagner

Quelle: Discrete Applied Mathematics. 329:23-34

Schlagwörter: 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, Safe Set Problem, Weighted Safe Set Problem, Branch-and-cut algorithm, Computational experiments, 01 natural sciences

Zugangs-URL: https://hdl.handle.net/11585/962340
https://doi.org/10.1016/j.dam.2022.12.022

On optimally solving sub‐tree scheduling for wireless sensor networks with partial coverage: A branch‐and‐cut algorithm

Autoren: Nicola Bianchessi

Quelle: Networks. 81:499-513

Schlagwörter: wireless sensor network, consecutive time slots, sub-tree scheduling, partial coverage, energy consumption minimization, branch-and-cut algorithm

Dateibeschreibung: application/pdf

A deep learning model for the localization and extraction of brain tumors from MR images using YOLOv7 and grab cut algorithm

Autoren: Srigiri Krishnapriya Yepuganti Karuna

Quelle: Front Oncol
Frontiers in Oncology, Vol 14 (2024)

Schlagwörter: YOLOv7, 0301 basic medicine, 03 medical and health sciences, magnetic resonance imaging (MRI), Oncology, 0202 electrical engineering, electronic engineering, information engineering, deep learning, Neoplasms. Tumors. Oncology. Including cancer and carcinogens, gamma correction, 02 engineering and technology, grab cut algorithm, brain tumor, RC254-282

Zugangs-URL: https://pubmed.ncbi.nlm.nih.gov/38680854
https://doaj.org/article/001c3c1bfc084badaca3f46a99f49f06

A new formulation for the Weighted Safe Set Problem

Autoren: Malaguti E. Pedrotti V.

Quelle: Procedia Computer Science. 195:508-515

Schlagwörter: 0211 other engineering and technologies, Branch-and-cut Algorithm, Safe Set Problem, Weighted Safe Set Problem, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

Multi-Objective Trip Planning With Solution Ranking Based on User Preference and Restaurant Selection

Autoren: Supoj Choachaicharoenkul David Coit Naruemon Wattanapongsakorn

Quelle: IEEE Access, Vol 10, Pp 10688-10705 (2022)

Schlagwörter: Vehicle Routing Problem and Variants, Artificial intelligence, decision support system, Profit (economics), Economics, Social Sciences, Travel Behavior, Transportation, 02 engineering and technology, Operations research, Industrial and Manufacturing Engineering, Tourism, FOS: Economics and business, Engineering, Selection (genetic algorithm), Greedy algorithm, 11. Sustainability, FOS: Mathematics, Microeconomics, 0202 electrical engineering, electronic engineering, information engineering, orienteering problem, Vehicle Routing Problem, Geography, Mathematical optimization, Branch-and-cut algorithm, Ranking (information retrieval), solution ranking, Understanding Attitudes Towards Public Transport and Private Car, Transit Network Design, Computer science, TK1-9971, Programming language, Algorithm, greedy algorithm, multi-objective optimization, Computational Theory and Mathematics, Orienteering, Archaeology, Solver, Physical Sciences, Computer Science, Travel Time Reliability, Electrical engineering. Electronics. Nuclear engineering, Multiobjective Optimization in Evolutionary Algorithms, Pareto principle, Mathematics

Zugangs-URL: https://ieeexplore.ieee.org/ielx7/6287639/9668973/09686707.pdf
https://doaj.org/article/204f4a2deadc479da3a198f9dc8d9c63

A Branch-and-Price-and-Cut Algorithm for the Inland Container Transportation Problem with Limited Depot Capacity

Autoren: Yujian Song Yuting Zhang

Quelle: Applied Sciences, Vol 14, Iss 24, p 11958 (2024)

Schlagwörter: inland container transportation, limited depot capacity, empty container, branch-and-price-and-cut algorithm, Technology, Engineering (General). Civil engineering (General), TA1-2040, Biology (General), QH301-705.5, Physics, QC1-999, Chemistry, QD1-999

Dateibeschreibung: electronic resource

Relation: https://www.mdpi.com/2076-3417/14/24/11958; https://doaj.org/toc/2076-3417

Zugangs-URL: https://doaj.org/article/c9d516df9cff49848dd7f782411c4f19

The traveling purchaser problem for perishable foods

Autoren: Kucukoglu, Ilker Vansteenwegen, Pieter Cattrysse, Dirk

Quelle: ISSN:0360-8352 ; ISSN:1879-0550 ; Computers & Industrial Engineering, vol. 195, Art.No. ARTN 110424.

Schlagwörter: Science & Technology, Technology, Computer Science, Interdisciplinary Applications, Engineering, Industrial, Traveling purchaser problem, Perishable foods, Meta-heuristics, Adaptive large neighborhood search, Simulated annealing, LARGE-NEIGHBORHOOD SEARCH, VEHICLE-ROUTING PROBLEM, CUT ALGORITHM, DELIVERY PROBLEM, OPTIMIZATION, HEURISTICS, STRATEGIES, PICKUP, MODEL, 01 Mathematical Sciences, 08 Information and Computing Sciences, 09 Engineering, Industrial Engineering & Automation, 40 Engineering, 46 Information and computing sciences, 49 Mathematical sciences

Dateibeschreibung: application/pdf

Relation: https://lirias.kuleuven.be/handle/20.500.12942/748290; https://doi.org/10.1016/j.cie.2024.110424

Verfügbarkeit: https://lirias.kuleuven.be/handle/20.500.12942/748290
https://hdl.handle.net/20.500.12942/748290
https://lirias.kuleuven.be/retrieve/ced67910-db87-4242-a71a-3f07b15390b2
https://doi.org/10.1016/j.cie.2024.110424

The consistent vehicle routing problem considering path consistency in a road network

Autoren: Yu Yao Tom Van Woensel Lucas P. Veelenturf et al.

Quelle: Transportation Research Part B: Methodological. 153:21-44

Schlagwörter: 0211 other engineering and technologies, Branch-price-and-cut algorithm, Consistency, 02 engineering and technology, Road network, VRP

Zugangs-URL: https://pure.eur.nl/en/publications/c06b7fdc-47b1-423e-89ca-485ac975d42c
https://doi.org/10.1016/j.trb.2021.09.005
https://research.tue.nl/en/publications/a74cb89a-7280-49b0-a437-e54d0a723503
https://doi.org/10.1016/j.trb.2021.09.005
https://www.sciencedirect.com/science/article/pii/S0191261521001727
https://research.tue.nl/en/publications/the-consistent-vehicle-routing-problem-considering-path-consisten
http://www.sciencedirect.com/science/article/pii/S0191261521001727
https://trid.trb.org/view/1880755

Hub Location, Routing, and Route Dimensioning: Strategic and Tactical Intermodal Transportation Hub Network Design

Autoren: Yildiz, Baris Yaman, Hande Ekin Karasan, Oya et al.

Weitere Verfasser: Yildiz, Baris Yaman, Hande Ekin Karasan, Oya et al.

Quelle: Transportation Science

Schlagwörter: Technology, branch and cut, Multimodal transport, network design, 0211 other engineering and technologies, 3509 Transportation, logistics and supply chains, Transportation, 02 engineering and technology, Next-day delivery, Operations research and management science, route dimensioning, 1507 Transportation and Freight Services, 0102 Applied Mathematics, 11. Sustainability, 4901 Applied mathematics, multimodal transport, Network design, Cut, FORMULATIONS, Branch, Hub location, Route dimensioning, Science & Technology, ECONOMIES, Operations Research & Management Science, Transportation Science & Technology, Logistics & Transportation, next-day delivery, Branch and cut, CUT ALGORITHM, BRANCH, BENDERS DECOMPOSITION, hub location

Dateibeschreibung: pdf; application/pdf

Zugangs-URL: http://repository.bilkent.edu.tr/bitstream/11693/77369/1/Hub_Location%2c_Routing%2c_and_Route_Dimensioning_Strategic_and_Tactical_Intermodal_Transportation_Hub_Network_Design.pdf
https://pubsonline.informs.org/doi/abs/10.1287/trsc.2021.1070
http://cdm21054.contentdm.oclc.org/cdm/ref/collection/IR/id/10205
https://hdl.handle.net/11693/77369

Robust multi-product newsvendor model with uncertain demand and substitution

Autoren: Jie Zhang Weijun Xie Subhash C. Sarin et al.

Weitere Verfasser: Jie Zhang Weijun Xie Subhash C. Sarin et al.

Quelle: European Journal of Operational Research. 293:190-202

Schlagwörter: Technology, Operations Research, 0209 industrial biotechnology, Operations Research & Management Science, 0211 other engineering and technologies, Social Sciences, Stochastic programming, 02 engineering and technology, Management, Business & Economics, Robust, Branch and cut algorithm, Mixed-integer program, Cardinality-constrained uncertainty set

Dateibeschreibung: 13 page(s); application/pdf

Zugangs-URL: https://vtechworks.lib.vt.edu/bitstream/10919/105059/2/6891.pdf
https://vtechworks.lib.vt.edu/handle/10919/105059
https://www.sciencedirect.com/science/article/pii/S0377221720310511
https://dblp.uni-trier.de/db/journals/eor/eor293.html#ZhangXS21
http://hdl.handle.net/10919/105059
https://doi.org/10.1016/j.ejor.2020.12.023