Search Results - "programming: integer algorithm branch and bound"

The Lagrangian Relaxation Method for Solving Integer Programming Problems by Fisher, Marshall L

“…( This article originally appeared in Management Science, January 1981, Volume 27, Number 1, pp. 1–18, published by The Institute of Management Sciences. ) One…”
Get full text

Laying Out Sparse Graphs with Provably Minimum Bandwidth by Caprara, Alberto, Salazar-Gonzalez, Juan-Jose

“…Finding a linear layout of a graph having minimum bandwidth is a combinatorial optimization problem that has been studied since the 1960s. Unlike other…”
Get full text

The Lagrangian Relaxation Method for Solving Integer Programming Problems by Fisher, Marshall L

“…One of the most computationally useful ideas of the 1970s is the observation that many hard integer programming problems can be viewed as easy problems…”
Get full text

A Comparison of Exact Approaches for Solving the Multiple Constrained Resource, Project Scheduling Problem by Patterson, James H

“…A recurring problem in managing project activity involves the allocation of scarce resources to the individual activities comprising the project Resource…”
Get full text

Resource Allocation to Interrelated Risky Projects Using a Multiattribute Utility Function by Mehrez, Abraham, Sinuany-Stern, Zilla

“…Two major contributions are made to the problem of resource allocation to indivisible projects with uncertain outcomes: the concepts of preferential…”
Get full text

A graph-theoretic decomposition of the job shop scheduling problem to achieve scheduling robustness by Wu, S David, Eui-Seok Byeon, Storer, Robert H

“…The weighted tardiness job-shop scheduling problem is studied, with the presence of random shop disturbances being taken into consideration. A basic thesis of…”
Get full text

An Exact Algorithm for the Two-Constraint 0-1 Knapsack Problem by Martello, Silvano, Toth, Paolo

“…We consider a knapsack problem in which each item has two types of weight and the container has two types of capacity. We discuss the surrogate, Lagrangian,…”
Get full text

Minimizing the Average Query Complexity of Learning Monotone Boolean Functions by Torvik, Vetle I, Triantaphyllou, Evangelos

“…This paper addresses the problem of completely reconstructing deterministic monotone Boolean functions via membership queries. The minimum average query…”
Get full text

Branch and Bound Experiments in Convex Nonlinear Integer Programming by Gupta, Omprakash K, Ravindran, A

“…The branch and bound principle has long been established as an effective computational tool for solving mixed integer linear programming problems. This paper…”
Get full text

Models Arising from a Flexible Manufacturing Machine, Part II: Minimization of the Number of Switching Instants by Tang, Christopher S, Denardo, Eric V

“…This paper deals with a job scheduling problem for a flexible manufacturing machine. We consider the same manufacturing environment described in a companion…”
Get full text

Minimizing Mean Squared Deviation of Completion Times About a Common Due Date by Bagchi, Uttarayan, Sullivan, Robert S, Chang, Yih-Long

“…This paper addresses a nonpreemptive single machine scheduling problem where all jobs have a common due date and have zero ready time. The scheduling objective…”
Get full text

A Dual-Based Procedure for Dynamic Facility Location by Van Roy, Tony J, Erlenkotter, Donald

“…In dynamic facility location problems, one desires to select the time-staged establishment of facilities at different locations so as to minimize the total…”
Get full text

Heuristics for Multilevel Lot-Sizing with a Bottleneck by Billington, Peter J, McClain, John O, Thomas, L. Joseph

“…In this paper we present a heuristic method, based on Lagrangian relaxation, for multilevel lot-sizing when there is a single bottleneck facility. A series of…”
Get full text

Assembly Line Balancing with Processing Alternatives: An Application by Pinto, Peter A, Dannenbring, David G, Khumawala, Basheer M

“…The conventional approach to the assembly line balancing problem assumes that the manufacturing methods to be used have been predetermined. However, in…”
Get full text

Note--On the Single Machine Scheduling Problem with Quadratic Penalty Function of Completion Times: An Improved Branching Procedure by Gupta, Sushil K, Sen, Tapan

“…This paper gives optimality conditions to obtain a priori precedence relationships among some of the jobs in a single machine scheduling problem so as to…”
Get full text

Note--Multi-Activity Facility Design and Location Problems by Akinc, Umit

“…This paper considers the problem of optimally locating multi-activity facilities whose activity compositions are also to be determined. It is assumed that…”
Get full text

Improved Penalties for Fixed Cost Linear Programs Using Lagrangean Relaxation by Cabot, A. Victor, Erenguc, S. Selcuk

“…The most commonly used penalty in branch and bound approaches to integer programming is the Driebeek–Tomlin penalty. It has been used successfully in solving…”
Get full text

Note--A Node Elimination Procedure for Townsend's Algorithm for Solving the Single Machine Quadratic Penalty Function Scheduling Problem by Bagga, P. C, Kalra, K. R

“…In this note, a node elimination procedure has been suggested in case the two sequences obtained by using Townsend's (Townsend, W. 1978. The single machine…”
Get full text

A Branch and Bound Algorithm for the List Selection Problem in Direct Mail Advertising by Dwyer, F. Robert, Evans, James R

“…This paper describes a branch and bound approach for optimizing a media selection problem, namely, to choose the best set of mailing lists to maximize audience…”
Get full text

A Greedy Heuristic for Single Machine Sequencing with Precedence Constraints by Weiss, Howard J

“…We present a greedy heuristic for the n job/1 machine scheduling problem with precedence constraints. This method is useful whenever the manager's optimization…”
Get full text