Max–max, max–min, min–max and min–min knapsack problems with a parametric constraint

Nir Halman; Mikhail Y. Kovalyov; Alain Quilliot

doi:10.1007/s10288-022-00509-1

ScienceGate Book Chapters

JOURNAL ARTICLE

Max–max, max–min, min–max and min–min knapsack problems with a parametric constraint

Nir Halman Mikhail Y. Kovalyov Alain Quilliot

Year: 2022 Journal: 4OR Vol: 21 (2)Pages: 235-246 Publisher: Springer Science+Business Media

DOI: 10.1007/s10288-022-00509-1

Get Full-Text PDF Get Analytical Report

Keywords:

Knapsack problem Mathematics Constraint (computer-aided design) Combinatorics Parametric statistics Continuous knapsack problem Mathematical optimization Discrete mathematics Geometry Statistics

Metrics

Cited By

0.16

FWCI (Field Weighted Citation Impact)

Refs

0.53

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Optimization and Packing Problems

Physical Sciences → Engineering → Industrial and Manufacturing Engineering

Advanced Manufacturing and Logistics Optimization

Physical Sciences → Engineering → Industrial and Manufacturing Engineering

Optimization and Search Problems

Physical Sciences → Computer Science → Computer Networks and Communications

Max–max, max–min, min–max and min–min knapsack problems with a parametric constraint

Metrics

Citation History

Topics

Related Documents

Max-Min Problems

An aggregate deformation homotopy method for min-max-min problems with max-min constraints

Min-max and max-min graph saturation parameters

Dynamic Min-Max problems

On max‐min problems