Suchergebnisse - "enhanced branch and bound algorithm"

Enhanced Branch and Bound Algorithm: Minimizing Subproblem Complexity in Power Dispatch

Autoren: Elif Cesur Muhammet Raşit Cesur Ajith Abraham

Quelle: IEEE Access, Vol 12, Pp 93753-93760 (2024)

Schlagwörter: enhanced branch and bound algorithm, pruning strategy, power dispatching optimization, 0202 electrical engineering, electronic engineering, information engineering, Electrical engineering. Electronics. Nuclear engineering, 02 engineering and technology, Branch and bound algorithm, TK1-9971

Zugangs-URL: https://doaj.org/article/9613fb2a9f2345049bb74614497e0645

Enhanced branch-and-bound algorithm for chance constrained programs with Gaussian mixture models

Autoren: Jinxiang Wei Zhaolin Hu Jun Luo et al.

Quelle: Annals of Operations Research. 338:1283-1315

A fast MILP solver for high-level synthesis based on heuristic model reduction and enhanced branch and bound algorithm

Autoren: Mina Mirhosseini Mahmood Fazlali Mohammad K Fallah et al.

Quelle: The Journal of Supercomputing. 79:12042-12073

An enhanced branch-and-bound algorithm for bilevel integer linear programming

Autoren: Shaonan Liu Mingzheng Wang Nan Kong et al.

Quelle: European Journal of Operational Research. 291:661-679

Schlagwörter: 0211 other engineering and technologies, 02 engineering and technology

Zugangs-URL: https://www.sciencedirect.com/science/article/pii/S0377221720308614
https://dblp.uni-trier.de/db/journals/eor/eor291.html#LiuWKH21
https://ideas.repec.org/a/eee/ejores/v291y2021i2p661-679.html
https://doi.org/10.1016/j.ejor.2020.10.002

An enhanced branch-and-bound algorithm for the talent scheduling problem

Autoren: Hu Qin Andrew Lim Xiaocong Liang et al.

Quelle: European Journal of Operational Research. 250:412-426

Schlagwörter: FOS: Computer and information sciences, Artificial Intelligence (cs.AI), Computer Science - Artificial Intelligence, 0211 other engineering and technologies, 02 engineering and technology, 16. Peace & justice

Zugangs-URL: http://arxiv.org/pdf/1401.5869
http://arxiv.org/abs/1401.5869
https://scholars.cityu.edu.hk/en/publications/an-enhanced-branchandbound-algorithm-for-the-talent-scheduling-problem(78ee3c72-d193-4de1-98bd-f73e6f233890)/fingerprints.html
https://ideas.repec.org/a/eee/ejores/v250y2016i2p412-426.html
https://www.sciencedirect.com/science/article/pii/S0377221715009091
https://dblp.uni-trier.de/db/journals/corr/corr1401.html#ZhangQLL14
http://www.sciencedirect.com/science/article/pii/S0377221715009091
https://doi.org/10.1016/j.ejor.2015.10.002

An enhanced branch‐and‐bound algorithm for a partitioning problem

Autoren: Michael J. Brusco

Quelle: British Journal of Mathematical and Statistical Psychology. 56:83-92

Schlagwörter: 0504 sociology, 05 social sciences, 0211 other engineering and technologies, Humans, Psychology, 02 engineering and technology, Models, Psychological, Algorithms

Zugangs-URL: https://pubmed.ncbi.nlm.nih.gov/12803823
http://europepmc.org/abstract/MED/12803823
http://onlinelibrary.wiley.com/doi/10.1348/000711003321645359/abstract
https://bpspsychub.onlinelibrary.wiley.com/doi/abs/10.1348/000711003321645359

An Enhanced Branch-and-bound Algorithm for the Talent Scheduling Problem

Autoren: Zhang, Zizhen Qin, Hu Liang, Xiaocong et al.

Index Begriffe: Computer Science - Artificial Intelligence, text

URL: http://arxiv.org/abs/1401.5869

Enhanced branch-and-bound algorithm for chance constrained programs with Gaussian mixture models.

Autoren: Wei, Jinxiang Hu, Zhaolin Luo, Jun et al.

Quelle: Annals of Operations Research; Jul2024, Vol. 338 Issue 2/3, p1283-1315, 33p

Schlagwörter: GAUSSIAN mixture models, PROBLEM solving, ALGORITHMS

A fast MILP solver for high-level synthesis based on heuristic model reduction and enhanced branch and bound algorithm.

Autoren: Mirhosseini, Mina Fazlali, Mahmood Fallah, Mohammad K et al.

Quelle: Journal of Supercomputing; Jul2023, Vol. 79 Issue 11, p12042-12073, 32p

Schlagwörter: BRANCH & bound algorithms, MIXED integer linear programming, MATHEMATICAL forms, FLOWGRAPHS, NP-hard problems

An enhanced branch-and-bound algorithm for a partitioning problem.

Autoren: Brusco, Michael J.

Quelle: British Journal of Mathematical & Statistical Psychology; May2003, Vol. 56 Issue 1, p83, 10p

Schlagwörter: BRANCH & bound algorithms, DYNAMIC programming, MATHEMATICAL programming

An enhanced branch-and-bound algorithm for bilevel integer linear programming

Autoren: Liu, Shaonan Wang, Mingzheng Kong, Nan et al.

Relation: http://www.sciencedirect.com/science/article/pii/S0377221720308614

Verfügbarkeit: http://www.sciencedirect.com/science/article/pii/S0377221720308614

An enhanced branch-and-bound algorithm for the talent scheduling problem

Autoren: Qin, Hu Zhang, Zizhen Lim, Andrew et al.

Relation: http://www.sciencedirect.com/science/article/pii/S0377221715009091

Verfügbarkeit: http://www.sciencedirect.com/science/article/pii/S0377221715009091

Finding the needle in the haystack—An interpretable sequential pattern mining method for classification problems.

Autoren: Grote, Alexander Hariharan, Anuja Weinhardt, Christof

Quelle: Frontiers in Big Data; 2025, p1-18, 18p

A bisection method for solving distance-based clustering problems globally.

Autoren: Kirst, Peter Bajbar, Tomáš Merkel, Mario

Quelle: TOP (1134-5764); Oct2025, Vol. 33 Issue 3, p437-469, 33p

Some studies on stochastic optimization based quantitative risk management.

Alternate Title: 基于随机优化的量化风险管理的一些研究. (Chinese)

Autoren: HU, Zhaolin

Quelle: Operations Research Transactions / Yunchouxue Xuebao; Sep2025, Vol. 29 Issue 3, p135-159, 25p

Schlagwörter: RISK assessment, STOCHASTIC programming, DECISION making, MATHEMATICAL optimization, SIMULATION methods & models

Node Embedding and Cosine Similarity for Efficient Maximum Common Subgraph Discovery.

Autoren: Quer, Stefano Madeo, Thomas Calabrese, Andrea et al.

Quelle: Applied Sciences (2076-3417); Aug2025, Vol. 15 Issue 16, p8920, 24p

Schlagwörter: GRAPH neural networks, SCALABILITY, REPRESENTATIONS of graphs, GRAPH algorithms, HEURISTIC

On supervalid inequalities for binary interdiction games.

Autoren: Wei, Ningji Walteros, Jose L.

Quelle: Mathematical Programming; Jul2025, Vol. 212 Issue 1, p437-478, 42p

Schlagwörter: MIXED integer linear programming, INTEGER programming, SPANNING trees, SYSTEMS engineering, INTEGERS

Second‐order cone programming models for the unitary weighted Weber problem and for the minimum sum of the squares clustering problem.

Autoren: Linhares, Marcella Braga de Assis Pinto, Renan Vicente Maculan, Nelson et al.

Quelle: International Transactions in Operational Research; Mar2025, Vol. 32 Issue 2, p961-972, 12p

Schlagwörter: SUM of squares, COMBINATORIAL optimization, NONLINEAR programming, CONES, INTEGERS

Branch Definition–Based Modeling for Sustainable Supply Chain Management in Regional Digital Economy.

Autoren: Qiu, Jinping

Quelle: Process Integration & Optimization for Sustainability; Nov2024, Vol. 8 Issue 5, p1603-1614, 12p

Bilevel interactive optimisation for rebatching scheduling problem with selectivity banks in high variety flow line production.

Autoren: Chen, Wenchong Gong, Xuejian Liu, Fangyu et al.

Quelle: International Journal of Production Research; Jun2022, Vol. 60 Issue 12, p3879-3900, 22p, 8 Diagrams, 9 Charts, 3 Graphs

Schlagwörter: BILEVEL programming, AUTOMOTIVE painting & paint shops, MASS customization, DYNAMIC programming, GENETIC algorithms