Results 81 to 85 of about 502 (85)

Mass – A New Ones Assignment Method for Finding Optimal Solution of Assignment Problems

, 2021
An assignment problem (AP) is a particular case of a transportation problem, in which the objective is to assign a number of facilities to an equal number of activities at an overall minimum cost, distance, time (or maximum profit). It occupies extremely
T. Esakkiammal
semanticscholar   +1 more source

A branch and cut algorithm for MAX-SAT and weighted MAX-SAT

Satisfiability Problem: Theory and Applications, 1996
DIMACS Series in Discrete Mathematicsand Theoretical Computer ScienceVolume00, 19xxA Branch and Cut Algorithm for MAX-SAT and WeightedMAX-SATSteveJoy, John Mitchell, and Brian BorchersAbstract.We describ e a branch and cut algorithm for b oth MAX-SAT ...
S. Joy, J. Mitchell, B. Borchers
semanticscholar   +1 more source

A queuing theoretical model for anticancer tool selection

, 2007
This study derived a mathematical anticancer tool selection model, which minimizes (or maximizes) the overall survival (or damage) probability of tumor while keeping the total side effect and cost of the tools at acceptable levels, for ...
Eyüp Çet
semanticscholar   +1 more source

Ranking tournaments with no errors

, 2017
This paper examines the classical problem of ranking a set of players on the basis of a set of pairwise comparisons arising from a sports tournament; the objective is to minimize the total number of upsets, where an upset occurs if a higher ranked player
Qiulan Zhao
semanticscholar   +1 more source

An integer programming formulation of the bid evaluation problem for coordinated tasks

, 2002
John Collins, Maria L. Gini
semanticscholar   +1 more source