Nearness and bound relationships between an integer-programming problem and its relaxed linear-programming problem

Journal article

Peer reviewed

A JOSEPH, S. I GASS and N. A BRYSON

Journal of optimization theory and applications, Vol.98(1), pp.55-63

1998

Abstract

Applied sciences

Operational research and scientific management

Operational research. Management science

Exact sciences and technology

Mathematical programming

13 Record Views

These are selected metrics from InCites Benchmarking & Analytics tool, related to this output

Collaboration types: Domestic collaboration
Citation topics: 4 Electrical Engineering, Electronics & Computer Science; 4.84 Supply Chain & Logistics; 4.84.1014 MINLP
Web Of Science research areas: Mathematics, Applied; Operations Research & Management Science
ESI research areas: Engineering

This output has contributed to the advancement of the following goals:

Source: InCites

Title: Nearness and bound relationships between an integer-programming problem and its relaxed linear-programming problem
Creators: A JOSEPH - Department of Management Science, University of Miami, Coral Gables, Florida, United States
S. I GASS - College of Business and Management, University of Maryland, College Park, Maryland, United States
N. A BRYSON - Department of Information Systems and Analysis, Howard University, Washington, DC, United States
Publication Details: Journal of optimization theory and applications, Vol.98(1), pp.55-63
Publisher: Springer; New York, NY
Academic Unit: Miami Herbert Business School; MHBS - Management Science
Language: English
Resource Type: Journal article
Record Identifier: 991031562304902976