Search results

From MaRDI portal
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)
  • https://portal.mardi4nfdi.de/entity/Q5294084 2007-07-23 Paper Fully Polynomial Approximation Schemes for Single-Item Capacitated Economic Lot-Sizing Problems...
    10 bytes (23 words) - 04:39, 12 December 2023
  • Publication Type Pipeline Interventions 2023-01-09 Paper Fully Polynomial-Time Approximation Schemes for Fair Rent Division 2022-09-26 Paper Fair and efficient...
    10 bytes (18 words) - 10:16, 6 October 2023
  • Division Under Monotone Likelihood Ratios 2022-09-26 Paper Fully Polynomial-Time Approximation Schemes for Fair Rent Division 2022-09-26 Paper Fair and efficient...
    10 bytes (16 words) - 10:16, 6 October 2023
  • scheduling with release dates and rejection 2016-05-10 Paper Fully Polynomial Time Approximation Schemes for Stochastic Dynamic Programs 2015-04-17 Paper Improved...
    10 bytes (19 words) - 15:06, 10 December 2023
  • deterministic fully polynomial time approximation scheme for counting integer knapsack solutions made easy 2016-08-31 Paper Fully Polynomial Time Approximation...
    10 bytes (16 words) - 19:27, 6 October 2023
  • loads scheduling with limited memory 2010-09-02 Paper Fully Polynomial Time Approximation Schemes for Scheduling Divisible Loads 2010-08-17 Paper Experimental...
    10 bytes (16 words) - 12:31, 28 January 2024
  • two-machine flow shop with release times. 2003-07-27 Paper Fast fully polynomial approximation schemes for minimizing completion time variance 2002-06-16 Paper...
    10 bytes (16 words) - 20:50, 24 September 2023
  • completion time of deteriorating jobs 2002-07-14 Paper Fast fully polynomial approximation schemes for minimizing completion time variance 2002-06-16 Paper...
    10 bytes (19 words) - 16:59, 9 December 2023
  • Scheduling of UET Jobs on Two Machines 2002-07-01 Paper Fast fully polynomial approximation schemes for minimizing completion time variance 2002-06-16 Paper...
    10 bytes (18 words) - 12:33, 9 December 2023
  • Paper A polynomial time algorithm for a deterministic joint pricing and inventory model 2005-11-16 Paper Fully Polynomial Approximation Schemes for Single-Item...
    10 bytes (21 words) - 23:44, 10 December 2023
  • scheduling 2015-07-28 Paper Attributes 2015-05-19 Paper Fully Polynomial Time Approximation Schemes for Stochastic Dynamic Programs 2015-04-17 Paper Inventory...
    10 bytes (16 words) - 07:11, 9 December 2023
  • Tight Approximation Bounds for Maximum Multi-coverage 2022-10-14 Paper Fair Cake Division Under Monotone Likelihood Ratios 2022-09-26 Paper Fully Polynomial-Time...
    10 bytes (16 words) - 10:16, 6 October 2023
  • 2003-11-09 Paper A 3/4-approximation algorithm for multiple subset sum 2003-08-28 Paper An efficient fully polynomial approximation scheme for the Subset-Sum...
    10 bytes (17 words) - 22:52, 9 December 2023
  • Analysis of Process Flexibility Designs 2015-10-22 Paper Fully Polynomial Time Approximation Schemes for Stochastic Dynamic Programs 2015-04-17 Paper Analyzing...
    10 bytes (19 words) - 14:51, 9 December 2023
  • 2002-01-01 Paper Approximation algorithms for the multiprocessor open shop scheduling problem 2001-09-03 Paper A fully polynomial approximation scheme for a scheduling...
    10 bytes (17 words) - 00:21, 12 December 2023
  • Paper Polynomial-time approximation schemes for two-machine open shop scheduling with nonavailability constraints 2007-02-20 Paper A fully polynomial approximation...
    10 bytes (19 words) - 17:03, 8 December 2023
  • Publication Date of Publication Type A fully polynomial-time approximation scheme for speed scaling with a sleep state 2019-08-20 Paper https://portal...
    10 bytes (16 words) - 03:23, 25 September 2023
  • Euclidean TSP with Hyperplane Neighborhoods 2019-10-15 Paper A fully polynomial-time approximation scheme for speed scaling with a sleep state 2019-08-20 Paper...
    10 bytes (18 words) - 12:37, 11 December 2023
  • facility locations and network connections 2016-10-07 Paper A Fully Polynomial Approximation Scheme for a Knapsack Problem with a Minimum Filling Constraint...
    10 bytes (16 words) - 10:50, 7 October 2023
  • statistical equivalence testing methods 2015-03-05 Paper A Fully Polynomial Approximation Scheme for Single-Product Scheduling in a Finite Capacity Facility...
    10 bytes (18 words) - 14:54, 28 January 2024
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)