A branch and bound procedure for the sparse assignment problem

A branch and bound procedure for the sparse assignment problem

Bibliographic Details
Main Author:	Wentz, William Russell
Published:	Georgia Institute of Technology 2008
Subjects:	Branch and bound algorithms Manpower planning
Online Access:	http://hdl.handle.net/1853/23426

Similar Items

Utilizing problem specic structures in branch and bound methods for manpower planning
by: Morén, Björn
Published: (2012)

Implementations and analysis of three parallel branch-and-bound algorithms for the vertex covering problem
by: Zariffa, Nohad.
Published: (1986)

Lower bound on size of branch-and-bound trees for solving lot-sizing problem
by: Dey, S.S, et al.
Published: (2022)

An implementation of a parallel generalized branch and bound template
by: Milda Baravykaitė, et al.
Published: (2007-09-01)

Global optimization using the branch‐and‐bound algorithm with a combination of Lipschitz bounds over simplices
by: Remigijus Paulavičius, et al.
Published: (2009-06-01)

Pre-decomposition of discrete optimization problems to speed up the branch and bound method in a distributed computing environment
by: S. A. Smirnov, et al.
Published: (2015-06-01)

PENERAPAN BRANCH AND BOUND ALGORITHM DALAM OPTIMALISASI PRODUKSI ROTI
by: GEDE SURYAWAN, et al.
Published: (2016-11-01)

Network models with generalized upper bound side constraints
by: Bolouri, Maryam
Published: (2013)

FIXED ORDER BRANCH AND BOUND METHODS FOR MIXED-INTEGER PROGRAMMING.
by: SINGHAL, JAYA ASTHANA.
Published: (1982)

An Algorithm Based on Theory of Constraints and Branch and Bound for Solving Integrated Product-Mix-Outsourcing Problem
by: Esmaeil Mehdizadeh, et al.
Published: (2019-01-01)

Template realization of generalized branch and bound algorithm
by: M. Baravykaite, et al.
Published: (2005-09-01)

Tool for Simulating Branch and Bound Computations
by: Ignatov Andrei, et al.
Published: (2020-05-01)

NK-MaxClique and MMCQ: Tow New Exact Branch and Bound Algorithms for the Maximum Clique Problem
by: Neda Mohammadi, et al.
Published: (2020-01-01)

Improvement of the branch and bound algorithm for solving the knapsack linear integer problem
by: Elias Munapo
Published: (2020-04-01)

Methods of using the quadratic assignment problem solution
by: Izabela Kudelska
Published: (2012-09-01)

OPTIMASI KEUNTUNGAN PRODUK KERIPIK SINGKONG MENGGUNAKAN METODE BRANCH AND BOUND DAN ALGORITMA GENETIKA PADA GNP SNACK
by: Sarif Hasan, et al.
Published: (2020-04-01)

Model and algorithms of the fuzzy three-dimensional axial assignement problem with an additional constraint
by: Chi-Jen Lin, et al.
Published: (2015-11-01)

Solving Composite MultiobjectiveSingle Machine Scheduling ProblemUsingBranch and Bound and Local SearchAlgorithms
by: Hafed Mohammed Motair
Published: (2018-07-01)

Solving the generalized assignment problem : a hybrid Tabu search/branch and bound algorithm
by: Woodcock, Andrew John
Published: (2007)

Progressive disaggregation for fixed charge network flow problems
by: Adaniya, Oscar
Published: (2009)

Grafting a Branch and Bound Method on a Genetic Algorithm for Balancing I / U-Shaped Assembly Lines
by: Octav Brudaru, et al.
Published: (2011-10-01)

Branch and bound with simplicial partitions for global optimization
by: Julius Žilinskas
Published: (2008-03-01)

Branch and Bound Algorithm for the Traveling Salesman Problem is not a Direct Type Algorithm
by: Aleksandr N. Maksimenko
Published: (2020-03-01)

Branch and Bound Algorithm for Multiprocessor Scheduling
by: Rahman, Mostafizur
Published: (2009)

Stochastic branch & bound applying target oriented branch & bound method to optimal scenario tree reduction
by: Stix, Volker
Published: (2002)

Using a new algorithm to improve the search answer in quadratic assignment problem (QAP)
by: Hossein Jafari, et al.
Published: (2021-06-01)

Influence of Lipschitz bounds on the speed of global optimization
by: Remigijus Paulavičius, et al.
Published: (2012-04-01)

Computing the weight of subtasks in state minimization of nondeterministic finite automata by the branch and bound method
by: M.E. Abramyan
Published: (2021-09-01)

Arc-path approaches to fixed charge network problems
by: Choe, Ui Chong
Published: (2008)

Branch and Bound Algorithm and an Improvement for Calculating the Nearest Link of Building a Railway Network
by: Waleed Mohammed Elaibi
Published: (2020-12-01)

Heterogeneity and locality-aware work stealing for large scale Branch-and-Bound irregular algorithms
by: Vu, Trong-Tuan
Published: (2014)

A tool for simulating parallel branch-and-bound methods
by: Golubeva Yana, et al.
Published: (2016-01-01)

Continuous and integer generalized flow problems
by: Langley, Robert Warren
Published: (2008)

Fixed-charge transportation problem: a group theoretic approach
by: Kennington, Jeffery Lynn
Published: (2008)

Improved upper bounds in clique partitioning problem
by: Alexander B. Belyi, et al.
Published: (2019-11-01)

Knapsack constraint reformulation: A new approach that significantly reduces the number of sub-problems in the branch and bound algorithm
by: Elias Munapo, et al.
Published: (2016-12-01)

Computational Complexity of Tree Evaluation Problems and Branching Program Satisfiability Problems
by: Nagao, Atsuki
Published: (2015)

<b>Evaluation of heuristics for a branch and bound algorithm to minimize the makespan in a flowshop with blocking
by: Felipe Borreiro Sanches, et al.
Published: (2016-06-01)

Penjadwalan Produksi Untuk Meminimalkan Waktu Produksi Dengan Menggunakan Metode Branch And Bound
by: Nunung Indra Lesmana
Published: (2017-05-01)

Computing real zeros of a polynomial by branch and bound and branch and reduce algorithms
by: Le Thi Hoai An, et al.
Published: (2014-01-01)