Notes on inverse bin-packing problems
From MaRDI portal
Publication:458387
DOI10.1016/j.ipl.2014.09.005zbMath1371.68095OpenAlexW2038359713MaRDI QIDQ458387
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
Combinatorial optimization (90C27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)
Related Items (2)
A parallel-machine scheduling problem with an antithetical property to maximize total weighted early work ⋮ A Parallel Machine Scheduling Problem Maximizing Total Weighted Early Work
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Reverse 2-median problem on trees
- The 0-1 inverse maximum stable set problem
- On an instance of the inverse shortest paths problem
- Differential approximation algorithms for some combinatorial optimization problems
- Inverse problem of minimum cuts
- On the use of an inverse shortest paths algorithm for recovering linearly correlated costs
- On an approximation measure founded on the links between optimization and polynomial approximation theory
- Weight reduction problems with certain bottleneck objectives.
- The complexity analysis of the inverse center location problem
- Approximation schemes for scheduling jobs with common due date on parallel machines to minimize Total tardiness
- Inverse combinatorial optimization: a survey on problems, methods, and results
- An inverse problem of the weighted shortest path problem
- On inverse traveling salesman problems
- The Multiple Subset Sum Problem
- Inverse Optimization
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Inverse maximum flow and minimum cut problems
- A column generation method for inverse shortest path problems
- A Faster Algorithm for the Inverse Spanning Tree Problem
- Scheduling with Deadlines and Loss Functions on k Parallel Machines
- Inverse Booking Problem: Inverse Chromatic Number Problem in Interval Graphs
This page was built for publication: Notes on inverse bin-packing problems
