Similar Search Results

On minimization of the number of branches in branch-and-bound algorithms for the maximum clique problem

Li, Chu-Min; Jiang, Hua; Manyà, Felip - In: Computers & operations research : and their … 84 (2017), pp. 1-15

Persistent link: https://www.econbiz.de/10011710166

A note on minimizing the sum of squares of machine completion times on two identical parallel machines

Walter, Rico - In: Central European journal of operations research : CEJOR … 25 (2017) 1, pp. 139-144

Persistent link: https://www.econbiz.de/10011710993

Multi-objective branch and bound

Przybylski, Anthony; Gandibleux, Xavier - In: European journal of operational research : EJOR 260 (2017) 3, pp. 856-872

Persistent link: https://www.econbiz.de/10011714239

The Block Retrieval Problem

Melo da Silva, Marcos de; Erdoğan, Güneş; Battarra, Maria - In: European journal of operational research : EJOR 265 (2018) 3, pp. 931-950

Persistent link: https://www.econbiz.de/10011778600

Exact approaches for the knapsack problem with setups

Furini, Fabio; Monaci, Michele; Traversi, Emiliano - In: Computers & operations research : and their … 90 (2018), pp. 208-220

Persistent link: https://www.econbiz.de/10011775328

A branch-and-bound algorithm for the prize-collecting single-machine scheduling problem with deadlines and total tardiness minimization

Cordone, Roberto; Hosteins, Pierre; Righini, Giovanni - In: INFORMS journal on computing : JOC 30 (2018) 1, pp. 168-180

Persistent link: https://www.econbiz.de/10011848225

An exact algorithm for the fixed charge transportation problem based on matching source and sink patterns

Mingozzi, Aristide; Roberti, Roberto - In: Transportation science : a journal of the Institute for … 52 (2018) 2, pp. 229-238

Persistent link: https://www.econbiz.de/10011852809

A fast and simple branching algorithm for solving small scale fixed-charge transportation problem

Kowalski, Krzysztof; Lev, Benjamin; Shen, Wenjing; Tu, Yan - In: Operations research perspectives 1 (2014) 1, pp. 1-5

In this paper, we develop a simple algorithm for obtaining the global solution to a small scale fixed-charge transportation problem (FCTP). The procedure itself is very quick. The proposed method solves FCTP by decomposing the problem into series of smaller sub-problems, which is novel and can...

Persistent link: https://www.econbiz.de/10011822002

A new upper bound for the maximum weight clique problem

Li, Chu-Min; Liu, Yanli; Jiang, Hua; Manyà, Felip; Li, Yu - In: European journal of operational research : EJOR 270 (2018) 1, pp. 66-77

Persistent link: https://www.econbiz.de/10011868925

A best-fit branch-and-bound heuristic for the unconstrained two-dimensional non-guillotine cutting problem

Wei, Lijun; Hu, Qian; Lim, Andrew; Liu, Qiang - In: European journal of operational research : EJOR 270 (2018) 2, pp. 448-474

Persistent link: https://www.econbiz.de/10011869044