منابع مشابه
Finding checkerboard patterns via fractional 0-1 programming
Biclustering is a simultaneous partitioning of the set of samples and the set of their attributes (features) into subsets (clusters). Samples and features clustered together are supposed to have a high relevance to each other. In this paper we provide a new mathematical programming formulation for unsupervised biclustering. The proposed model involves the solution of a fractional 0-1 programmin...
متن کاملStrong Formulations of Robust Mixed 0-1 Programming
We introduce strong formulations for robust mixed 0–1 programming with uncertain objective coefficients. We focus on a polytopic uncertainty set described by a “budget constraint” for allowed uncertainty in the objective coefficients. We show that for a robust 0–1 problem, there is an α–tight linear programming formulation with size polynomial in the size of an α–tight linear programming formul...
متن کامل0-1 Multiband Robust Optimization
We provide an overview of new theoretical results that we obtained while further investigating multiband robust optimization, a new model for robust optimization that we recently proposed to tackle uncertainty in mixed-integer linear programming. This new model extends and refines the classical Γ -robustness model of Bertsimas and Sim and is particularly useful in the common case of arbitrary a...
متن کاملAn Analysis of Dinkelbach's Algorithm for 0-1 Fractional Programming Problems
The 0-1 fractional programming problem minimizes the fractional objective function (c 1 x 1 + c 2 x 2 + + c n x n )=(d 1 x 1 + d 2 x 2 + + d n x n ) = cx=dx under the condition that x = (x 1 ; ; x n ) 2 f0; 1g n ; where is the set of feasible solutions. For a fractional programming problem, Dinkelbach developed an algorithm which obtains an optimal solution of the given problem by solving a seq...
متن کاملA Branch and Bound Algorithm for a Fractional 0-1 Programming Problem
We consider a fractional 0-1 programming problem arising in manufacturing. The problem consists in clustering of machines together with parts processed on these machines into manufacturing cells so that intra-cell processing of parts is maximized and inter-cell movement is minimized. This problem is called Cell Formation Problem (CFP) and it is an NP-hard optimization problem with Boolean varia...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: INFORMS Journal on Optimization
سال: 2020
ISSN: 2575-1484,2575-1492
DOI: 10.1287/ijoo.2019.0025