A heuristic with tie breaking for certain 0–1 integer programming models

DOI10.1002/NAV.3800320408zbMATH Open0597.90061OpenAlexW2084974704MaRDI QIDQ3731368FDOQ3731368

Authors: G. Edward Fox, Gary D. Scudder 

Publication date: 1985

Published in: Naval Research Logistics Quarterly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nav.3800320408

Recommendations

• A heuristic 0-1 integer programming method
• Zero-one integer programs with few constraints - Efficient branch and bound algorithms
• A simple strategy for solving a class of 0-1 integer programming models
• An analysis of six greedy selection rules on a class of zero-one integer programming models
• Mathematical programming based heuristics for the 0--1 MIP: a survey

zbMATH Keywords

heuristic0-1 integer linear programminggradient-type ruletie- breaking

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10) Boolean programming (90C09)

Cites Work

• Title not available (Why is that?)

Cited In (7)

• A \(K\)-means supported reinforcement learning framework to multi-dimensional knapsack
• An analysis of six greedy selection rules on a class of zero-one integer programming models
• Heuristic methods and applications: A categorized survey
• Problem reduction heuristic for the \(0\)-\(1\) multidimensional knapsack problem
• A heuristic 0-1 integer programming method
• Scheduling experiments on a nulear reactor using mixed integer programming
• A simple strategy for solving a class of 0-1 integer programming models

This page was built for publication: A heuristic with tie breaking for certain 0–1 integer programming models

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