Minimum $k$k-Vertex Connected Graph Search

Authors: Liu, Y., Huang, H., Yu, K., Liu, S., Long, C.

Source: IEEE Transactions on Knowledge and Data Engineering IEEE Trans. Knowl. Data Eng. Knowledge and Data Engineering, IEEE Transactions on. 37(7):4159-4165 Jul, 2025

Delay margin analysis of uncertain linear control systems using probabilistic µ: Delay margin analysis of uncertain linear control systems using probabilistic \(\mu\)

Authors: F. Somers, C. Roos, J.‐M. Biannic, F. Sanfedino, V. Preda, S. Bennani, H. Evain

Source: International Journal of Robust and Nonlinear Control. 35:2101-2118

Subject Terms: uncertain systems, Linear systems in control theory, robustness analysis, Control/observation systems with incomplete information, Delay control/observation systems, linear fractional representation, branch-and-bound algorithms, probabilistic \(\mu\)-analysis

File Description: application/xml

Access URL: https://zbmath.org/8034825
https://doi.org/10.1002/rnc.7780

A Novel Approach for Subgraph Isomorphism Problem on Bipartite Graphs

Authors: Koca, Mehmet Burak, Sevilgen, Fatih Erdogan

Source: 2019 27th Signal Processing and Communications Applications Conference (SIU) Signal Processing and Communications Applications Conference (SIU), 2019 27th. :1-4 Apr, 2019

Relation: 2019 27th Signal Processing and Communications Applications Conference (SIU)

NK-MaxClique and MMCQ: Tow New Exact Branch and Bound Algorithms for the Maximum Clique Problem

Authors: Mohammadi, N., Kadivar, M.

Source: IEEE Access Access, IEEE. 8:180045-180053 2020

Minimizing the Total Tardiness of a Game Project Considering the Overlap Effect

Authors: Wang, J., Chen, M., Jea, K.

Source: IEEE Access Access, IEEE. 8:216507-216518 2020

A Problem-Specific Branch-and-Bound Algorithm for the Protected Shortest Simple Path Problem with Must-Pass Nodes

Authors: Ogorodnikov, Y., Rudakov, R., Khachai, D., Khachay, M.

Source: IFAC-Papers

Subject Terms: MILP MODELS, 0211 other engineering and technologies, STRONGLY NP-HARD, FIXED SIZE, 02 engineering and technology, DIRECTED GRAPHS, MILP MODEL, 7. Clean energy, GRAPH ALGORITHMS, PROTECTED SHORT SIMPLE PATH PROBLEM WITH MUST-PASS NODE, INTEGER PROGRAMMING, BRANCH-AND-BOUND ALGORITHMS, SIMPLE++, PROTECTED SHORTEST SIMPLE PATH PROBLEM WITH MUST-PASS NODES, 0202 electrical engineering, electronic engineering, information engineering, TRANSPORTATION COST, BRANCH-AND-BOUND ALGORITHM, WEIGHTED DIRECTED GRAPH, PATH PROBLEMS, BRANCH AND BOUND METHOD, VERTEX DISJOINT PATHS

File Description: application/pdf

Intersection control strategy optimization based on exchangeable lanes modeling

Authors: Liu, Bo, Hou, Jingwen, Ma, Xiaoping, Shi, Mengtong, Lu, Sibo, Wang, Ruoxuan

Source: Smart and Resilient Transportation, 2022, Vol. 4, Issue 3, pp. 209-224.

Access URL: http://www.emeraldinsight.com/doi/10.1108/SRT-06-2022-0014

A GPU-accelerated Branch-and-Bound Algorithm for the Flow-Shop Scheduling Problem

Authors: Melab, N., Chakroun, I., Mezmaz, M., Tuyttens, D.

Source: 2012 IEEE International Conference on Cluster Computing Cluster Computing (CLUSTER), 2012 IEEE International Conference on. :10-17 Sep, 2012

Relation: 2012 IEEE International Conference on Cluster Computing (CLUSTER)

An Adaptative Multi-GPU Based Branch-and-Bound. A Case Study: The Flow-Shop Scheduling Problem

Authors: Chakroun, I., Melab, N.

Source: 2012 IEEE 14th International Conference on High Performance Computing and Communication & 2012 IEEE 9th International Conference on Embedded Software and Systems High Performance Computing and Communication & 2012 IEEE 9th International Conference on Embedded Software and Systems (HPCC-ICESS), 2012 IEEE 14th International Conference on. :389-395 Jun, 2012

Relation: 2012 IEEE 14th Int'l Conf. on High Performance Computing and Communication (HPCC) & 2012 IEEE 9th Int'l Conf. on Embedded Software and Systems (ICESS)

Un algorithme branch-and-bound pour résoudre exactement des problèmes d'optimisation parcimonieuse structurée

Authors: Samain, Gwenaël, Bourguignon, Sébastien, Ninin, Jordan

Contributors: Signal, IMage et Son (LS2N - équipe SIMS), Laboratoire des Sciences du Numérique de Nantes (LS2N), Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Institut Mines-Télécom Paris (IMT)-Institut Mines-Télécom Paris (IMT)-NANTES UNIVERSITÉ - École Centrale de Nantes (Nantes Univ - ECN), Nantes Université (Nantes Univ)-Nantes Université (Nantes Univ)-Nantes université - UFR des Sciences et des Techniques (Nantes univ - UFR ST), Nantes Université - pôle Sciences et technologie, Nantes Université (Nantes Univ)-Nantes Université (Nantes Univ)-Nantes Université - pôle Sciences et technologie, Nantes Université (Nantes Univ)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Nantes Université (Nantes Univ), Equipe Models and AlgoriThms for pRocessIng and eXtracting information (Lab-STICC_MATRIX), Laboratoire des sciences et techniques de l'information, de la communication et de la connaissance (Lab-STICC), École Nationale d'Ingénieurs de Brest (ENIB)-Université de Bretagne Sud (UBS)-Université de Brest (UBO)-École Nationale Supérieure de Techniques Avancées Bretagne (ENSTA Bretagne)-Institut Mines-Télécom Paris (IMT)-Centre National de la Recherche Scientifique (CNRS)-Université Bretagne Loire (UBL)-IMT Atlantique (IMT Atlantique), Institut Mines-Télécom Paris (IMT)-École Nationale d'Ingénieurs de Brest (ENIB)-Université de Bretagne Sud (UBS)-Université de Brest (UBO)-École Nationale Supérieure de Techniques Avancées Bretagne (ENSTA Bretagne)-Institut Mines-Télécom Paris (IMT)-Centre National de la Recherche Scientifique (CNRS)-Université Bretagne Loire (UBL)-IMT Atlantique (IMT Atlantique), Institut Mines-Télécom Paris (IMT), École Nationale Supérieure de Techniques Avancées Bretagne (ENSTA Bretagne)

Source: 24ème édition du congrès ROADEF, Recherche Opérationnelle et de l'Aide à la Décision en France
https://hal.science/hal-04272523
24ème édition du congrès ROADEF, Recherche Opérationnelle et de l'Aide à la Décision en France, Feb 2023, Rennes, France

Subject Terms: Sparse optimization, Branch-and-bound algorithms, Signal processing algorithms, Inverse problems, [INFO]Computer Science [cs]

Subject Geographic: Rennes, France

Availability: https://hal.science/hal-04272523
https://hal.science/hal-04272523v1/document
https://hal.science/hal-04272523v1/file/Samain_Bourguignon_Ninin_ROADEF2022_postreview1.pdf

RANGI: A Fast List-Colored Graph Motif Finding Algorithm

Authors: Rudi, Ali Gholami, Shahrivari, Saeed, Jalili, Saeed, Moghadam Kashani, Zahra Razaghi

Source: IEEE/ACM Transactions on Computational Biology and Bioinformatics IEEE/ACM Trans. Comput. Biol. and Bioinf. Computational Biology and Bioinformatics, IEEE/ACM Transactions on. 10(2):504-513 Apr, 2013

Fuzzy rule-based optimization in nonlinear predictive control

Authors: Setnes, M., Sousa, J. M.

Source: 1999 European Control Conference (ECC) Control Conference (ECC), 1999 European. :2771-2776 Aug, 1999

Relation: 1999 European Control Conference (ECC)

Branch and bound algorithms for rate-distortion optimized media streaming

Authors: Roder, M., Cardinal, J., Hamzaoui, R.

Source: IEEE Transactions on Multimedia IEEE Trans. Multimedia Multimedia, IEEE Transactions on. 8(1):170-178 Feb, 2006

Access point assignment algorithms in WLANs based on throughput objectives

Authors: Koukoutsidis, Ioannis, Siris, Vasilios A.

Source: 2008 6th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks and Workshops Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks and Workshops, 2008. WiOPT 2008. 6th International Symposium on. :375-383 Apr, 2008

Relation: 2008 6th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks and Workshops (WiOPT)

Faster algorithms for min-max-min robustness for combinatorial problems with budgeted uncertainty

Authors: André Chassein, Marc Goerigk, Jannis Kurtz, Michael Poss

Contributors: Poss, Michaël

Source: European Journal of Operational Research. 279:308-319

Subject Terms: k-adaptability, Optimization and Control (math.OC), FOS: Mathematics, 0211 other engineering and technologies, robust optimization, combinatorial optimization, budgeted uncertainty, 0102 computer and information sciences, 02 engineering and technology, branch-and-bound algorithms, Mathematics - Optimization and Control, 01 natural sciences, [INFO.INFO-RO] Computer Science [cs]/Operations Research [math.OC]

File Description: application/pdf

Access URL: https://www.sciencedirect.com/science/article/am/pii/S0377221719304758
http://arxiv.org/abs/1802.05072
https://www.sciencedirect.com/science/article/pii/S0377221719304758
https://hal.archives-ouvertes.fr/hal-02171552
https://hal.archives-ouvertes.fr/hal-02171552/document
https://www.sciencedirect.com/science/article/abs/pii/S0377221719304758#!
https://dblp.uni-trier.de/db/journals/eor/eor279.html#ChasseinGKP19

A Sampling Approach for Proactive Project Scheduling under Generalized Time-dependent Workability Uncertainty

Authors: SONG, Wen, KANG, Donghun, ZHANG, Jie, CAO, Zhiguang, XI, Hui

Contributors: School of Computer Science and Engineering, Rolls-Royce@NTU Corporate Lab

Source: Journal of Artificial Intelligence Research. 64:385-427

Subject Terms: Engineering::Computer science and engineering [DRNTU], Stochastic optimization model, Proactive Scheduling, Theory and Algorithms, 0211 other engineering and technologies, 02 engineering and technology, Partial order schedules, Branch-and-bound algorithms, Empirical evaluations, Uncertainty distributions, Sample average approximation, Branch-and-Bound Method, Real-world scenario, Proactive scheduling

File Description: application/pdf

Access URL: https://jair.org/index.php/jair/article/download/11369/26476
https://dr.ntu.edu.sg/handle/10356/105754?mode=simple
https://doi.org/10.1613/jair.1.11369
https://dr.ntu.edu.sg/bitstream/10356/105754/1/A%20sampling%20approach%20for%20proactive%20project%20scheduling%20under%20generalized%20time-dependent%20workability%20uncertainty.pdf
https://dblp.uni-trier.de/db/journals/jair/jair64.html#SongKZCX19

On some implementations of solving the resource constrained project scheduling problems

Authors: D. V. Mishin, Evgenii N. Goncharov, E. Kh. Gimadi

Source: Yugoslav Journal of Operations Research, Vol 29, Iss 1, Pp 31-42 (2019)

Subject Terms: project management, cumulative resources, 0209 industrial biotechnology, T58.6-58.62, resource constrained project scheduling problem, 0211 other engineering and technologies, branch and bound algorithms, Management information systems, 02 engineering and technology, pcplib, renewable resources, 7. Clean energy

Access URL: http://www.doiserbia.nb.rs/ft.aspx?id=0354-02431800025G
https://doaj.org/article/d84abc350dd4435c982f6ebc45470892
http://www.yujor.fon.bg.ac.rs/index.php/yujor/article/view/597
http://www.yujor.fon.bg.ac.rs/index.php/yujor/article/download/597/576

Branch-and-Bound Algorithms for Scheduling in Permutation Flowshops to Minimize the Sum of Weighted Flowtime/Sum of Weighted Tardiness/Sum of Weighted Flowtime and Weighted Tardiness/Sum of Weighted Flowtime, Weighted Tardiness and Weighted Earliness of Jobs

Authors: Madhushini, N., Rajendran, C., Deepa, Y.

Source: The Journal of the Operational Research Society, 2009 Jul 01. 60(7), 991-1004.

Access URL: https://www.jstor.org/stable/40206818

Optimization space pruning without regrets

Authors: Beaugnon, Ulysse, Pouille, Antoine, Pouzet, Marc, Pienaar, Jacques, Cohen, Albert

Contributors: Bourke, Timothy

Source: Proceedings of the 26th International Conference on Compiler Construction. :34-44

Subject Terms: 2. Zero hunger, GPU optimization, Compilers, 0103 physical sciences, [INFO.INFO-DC] Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], 0202 electrical engineering, electronic engineering, information engineering, Branch and bound algorithms, Performance Modeling, 02 engineering and technology, Search Space Exploration, 01 natural sciences

File Description: application/pdf

Access URL: https://hal.inria.fr/hal-01655602/file/paper.pdf
https://hal.inria.fr/hal-01655602
https://dblp.uni-trier.de/db/conf/cc/cc2017.html#BeaugnonPPP017
https://hal.inria.fr/hal-01655602/document
https://doi.org/10.1145/3033019.3033023
https://research.google/pubs/pub46935/
https://dl.acm.org/doi/10.1145/3033019.3033023

On linear programming relaxations for solving polynomial programming problems

Authors: Dalkiran, Evrim ^⁎, Ghalami, Laleh

Source: In Computers and Operations Research November 2018 99:67-77