Efficient algorithms for a scheduling problem and its applications to illicit drug market crackdowns

DOI10.1023/A:1009738610804zbMath0896.90136OpenAlexW1563516536MaRDI QIDQ1383799

Ashish V. Naik, Pu Cai, Jin-Yi Cai

Publication date: 25 May 1998

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1009738610804

zbMATH Keywords

dualitypolynomial time algorithmdrug market crackdown scheduling problemjob scheduling problemquasipolynomial time approximation algorithm

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35)

Related Items (1)

A review of four decades of time-dependent scheduling: main results, new topics, and open problems

This page was built for publication: Efficient algorithms for a scheduling problem and its applications to illicit drug market crackdowns