Recently Karmarkar proposed a potential reduction algorithm for binary feasibility problems. In this paper, a modified potential function that has more attractive properties is introduced. Furthermore, as the main res...
详细信息
Recently Karmarkar proposed a potential reduction algorithm for binary feasibility problems. In this paper, a modified potential function that has more attractive properties is introduced. Furthermore, as the main result, for a specific class of binary feasibility problems a concise reformulation as nonconvex quadratic optimization problems is developed. We introduce a potential function to optimize the new model and report on computational experience with the graph coloring problem, comparing the performance of the three potential functions. (C) 1997 Elsevier Science B.V.
The frequency assignment problem is the problem of assigning frequencies to transmission links such that either no interference occurs, or the amount of interference is minimized. We present an approximation algorithm...
详细信息
The frequency assignment problem is the problem of assigning frequencies to transmission links such that either no interference occurs, or the amount of interference is minimized. We present an approximation algorithm for this problem that is inspired by Karmarkar's interior point potential reduction approach to combinatorial optimization problems. A non convex quadratic model of the problem is developed, that is very compact as all interference constraints are incorporated in the objective function. Moreover, optimizing this model may result in finding multiple solutions to the problem simultaneouly. Several preprocessing techniques are discussed. We report on computational experience with both real-life and randomly generated instances.
SODA is a system by which the schedule of ships in a port can be found in order to minimize the demurrage and operating costs associated with shipping operations. SODA constructs and resolves binary programming models...
详细信息
This paper focuses on the combinatorial problems posed by tool selection for external turning operations. The problem of selecting the best set of tools to machine a component, according to a certain economic criterio...
详细信息
This paper focuses on the combinatorial problems posed by tool selection for external turning operations. The problem of selecting the best set of tools to machine a component, according to a certain economic criterion, is here addressed as a binary programming problem and a specific branch-and-bound method for dealing with it is described. The results obtained show that this method solves the problem quickly and with little effort.
binary programming models are presented to generate parallel tests from an itembank. The parallel tests are created to match item for item an existing seed test and match user supplied taxonomic specifications. The ta...
详细信息
binary programming models are presented to generate parallel tests from an itembank. The parallel tests are created to match item for item an existing seed test and match user supplied taxonomic specifications. The taxonomic specifications may be either obtained from the seed test or from some other user requirement. An algorithm is presented along with computational results to indicate the overall efficiency of the process. Empirical findings based on an itembank for the Arithmetic Reasoning section of the Armed Services Vocational Aptitude Battery are given.
An algorithmic approach to test design, using information functions, is presented. The approach uses a special branch of linear programming, i.e. binary programming. In addition, results of some benchmark problems are...
详细信息
An algorithmic approach to test design, using information functions, is presented. The approach uses a special branch of linear programming, i.e. binary programming. In addition, results of some benchmark problems are presented. Within the same framework, it is also possible to formulate the problem of individualized testing.
暂无评论