Results 21 to 30 of about 178,189 (288)
Al-Mustansiriyah Journal of Science, 2018 This paper present algorithms for solving a single machine scheduling problem to minimize the sum of total completion times, total tardiness,maxim-um tardiness,and maximum earliness.The single machine total tardiness problem is already NP-hard, so the ...
Hafed Mohammed Motair
doaj +1 more source
An Efficient Outer Space Algorithm for Generalized Linear Multiplicative Programming Problem
IEEE Access, 2020 Base on the outer space search and the branch-and-bound framework, this paper presents an efficient outer space branch-and-bound algorithm for globally solving generalized linear multiplicative programming problem.
Hongwei Jiao +4 more
doaj +1 more source
Multi-Threading a State-of-the-Art Maximum Clique Algorithm
Algorithms, 2013 We present a threaded parallel adaptation of a state-of-the-art maximum clique algorithm for dense, computationally challenging graphs. We show that near-linear speedups are achievable in practice and that superlinear speedups are common.
Patrick Prosser, Ciaran McCreesh
doaj +1 more source
Mathematics, 2023 Green scheduling that aims to enhance efficiency by optimizing resource allocation and job sequencing concurrently has gained growing academic attention.
Hongyu He +4 more
doaj +1 more source
Space-Efficient Parallel Algorithms for Combinatorial Search Problems [PDF]
, 2013 We present space-efficient parallel strategies for two fundamental combinatorial search problems, namely, backtrack search and branch-and-bound, both involving the visit of an $n$-node tree of height $h$ under the assumption that a node can be accessed ...
C. Kaklamanis +6 more
core +2 more sources
Single-Machine Scheduling to Minimize Total Completion Time and Tardiness with Two Competing Agents
The Scientific World Journal, 2014 We consider a single-machine two-agent problem where the objective is to minimize a weighted combination of the total completion time and the total tardiness of jobs from the first agent given that no tardy jobs are allowed for the second agent. A branch-
Wen-Chiung Lee +3 more
doaj +1 more source
Operator-level GPU-Accelerated Branch and Bound Algorithms
Procedia Computer Science, 2013 AbstractBranch-and-Bound (B&B) algorithms are well-known tree-based exploratory methods for solving to optimality NP-hard discrete optimization problems. The construction of the B&B tree and its exploration are performed using four operators: branching, bounding, selection and pruning.
Chakroun, Imen, Nouredine, Melab
openaire +2 more sources
Improved Lipschitz bounds with the first norm for function values over multidimensional simplex
Mathematical Modelling and Analysis, 2008 A branch and bound algorithm for global optimization is proposed, where the maximum of an upper bounding function based on Lipschitz condition and the first norm over a simplex is used as the upper bound of function.
Remigijus Paulavičius +1 more
doaj +1 more source
Towards Effective Exact Algorithms for the Maximum Balanced Biclique Problem [PDF]
, 2017 The Maximum Balanced Biclique Problem (MBBP) is a prominent model with numerous applications. Yet, the problem is NP-hard and thus computationally challenging. We propose novel ideas for designing effective exact algorithms for MBBP.
Hao, Jin-Kao, Rossi, André, Zhou, Yi
core +4 more sources
Advanced Engineering Materials, EarlyView.In this experimental study, the mechanical properties of additively manufactured Ti‐6Al‐4V lattice structures of different geometries are characterized using compression, four point bending and fatigue testing. While TPMS designs show superior fatigue resistance, SplitP and Honeycomb lattice structures combine high stiffness and strength. The resulting
Klaus Burkart +3 more
wiley +1 more source