Notes on inverse bin-packing problems

DOI10.1016/J.IPL.2014.09.005zbMATH Open1371.68095OpenAlexW2038359713MaRDI QIDQ458387FDOQ458387

Authors: Yerim Chung, Myoung-Ju Park 

Publication date: 7 October 2014

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2014.09.005

Recommendations

• The maximum resource bin packing problem
• Fundamentals of Computation Theory
• On a dual version of the one-dimensional bin packing problem
• The inverse \(\{0,1\}\)-knapsack problem: theory, algorithms and computational experiments
• An improved approximation scheme for variable-sized bin packing

zbMATH Keywords

approximation algorithmsNP-hardnesscombinatorial problemsinverse optimizationbin-packing problem

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Inverse problem of minimum cuts
• Inverse combinatorial optimization: a survey on problems, methods, and results
• The multiple subset sum problem
• Inverse maximum flow and minimum cut problems
• Differential approximation algorithms for some combinatorial optimization problems
• On an approximation measure founded on the links between optimization and polynomial approximation theory
• Title not available (Why is that?)
• The complexity analysis of the inverse center location problem
• Inverse Optimization
• On an instance of the inverse shortest paths problem
• On inverse traveling salesman problems
• On inverse chromatic number problems (extended abstract)
• Inverse Booking Problem: Inverse Chromatic Number Problem in Interval Graphs
• The 0-1 inverse maximum stable set problem
• Approximation schemes for scheduling jobs with common due date on parallel machines to minimize Total tardiness
• On the use of an inverse shortest paths algorithm for recovering linearly correlated costs
• An inverse problem of the weighted shortest path problem
• A column generation method for inverse shortest path problems
• Weight reduction problems with certain bottleneck objectives.
• Title not available (Why is that?)
• A Faster Algorithm for the Inverse Spanning Tree Problem
• Scheduling with Deadlines and Loss Functions on k Parallel Machines
• Reverse 2-median problem on trees

Cited In (3)

• A parallel-machine scheduling problem with an antithetical property to maximize total weighted early work
• Comments on the hierarchically structured bin packing problem
• A Parallel Machine Scheduling Problem Maximizing Total Weighted Early Work

This page was built for publication: Notes on inverse bin-packing problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q458387)