Efficient algorithms for a scheduling problem and its applications to illicit drug market crackdowns
type: Item
instance of: scholarly article
title: Efficient algorithms for a scheduling problem and its applications to illicit drug market crackdowns
zbMATH Open document ID: 0896.90136
DOI: 10.1023/A:1009738610804
author: Pu Cai
author: Jin-Yi Cai
author: Ashish V. Naik
published in: Journal of Combinatorial Optimization
publication date: 1998-05-25T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 1139574
zbMATH Keywords: job scheduling problem
zbMATH Keywords: drug market crackdown scheduling problem
zbMATH Keywords: duality
zbMATH Keywords: polynomial time algorithm
zbMATH Keywords: quasipolynomial time approximation algorithm
MaRDI profile type: Publication
full work available at URL: a:1009738610804
OpenAlex ID: W1563516536
Recommended article: On the optimality of exact and approximation algorithms for scheduling problems
Recommended article: Q3740554
Recommended article: Efficient algorithms for robustness in resource allocation and scheduling problems
Recommended article: Scheduling problems in a practical allocation model
Recommended article: Optimal algorithms for scheduling under time-of-use tariffs
Recommended article: Q4426361
Recommended article: Efficient (re-)scheduling: an auction approach
Recommended article: An efficient algorithm for finding ideal schedules
Recommended article: Q4527188
Recommended article: On approximating a scheduling problem
description: scientific article; zbMATH DE number 1139574