Výsledky vyhľadávania - large scale zero-one integer programming problems

An evolutionary fault diagnosis algorithm for interconnection networks under the PMC model Autor Liang, Jiarong, Guo, Yang, Xie, Yuhao, Liang, Xinyu

“… Based on graph theory, diagnostic algorithms for solving the problem of fault diagnosis in interconnection networks have been widely studied…”
Získať plný text

An exact algorithm for solving large-scale two-stage stochastic mixed-integer problems: Some theoretical and experimental aspects Autor Escudero, L.F., Garín, M.A., Merino, M., Pérez, G.

“…We present an algorithmic framework, so-called BFC-TSMIP, for solving two-stage stochastic mixed 0–1 problems…”
Získať plný text

ZIPMAP - A Zero-One Integer Programming Model for Market Segmentation and Product Positioning Autor Zufryden, Fred S.

“… The resulting mathematical model is stated as a large-scale, mixed, zero-one, integer, non-linear mathematical programming problem whose solution is sought through a two…”
Získať plný text

Approximation in enumeration techniques for large scale zero-one programming for corporate average fuel economy planning Autor Kostreva, M.M.

“… Computational difficulties were experienced on the large-scale zero-one linear integer programming problems that arose…”
Získať plný text

An algorithmic framework for solving large-scale multistage stochastic mixed 0–1 problems with nonsymmetric scenario trees Autor Escudero, Laureano F., Araceli Garín, María, Merino, María, Pérez, Gloria

“…In this paper we present a parallelizable Branch-and-Fix Coordination algorithm for solving medium and large-scale multistage mixed 0…”
Získať plný text

A dynamic programming based reduction procedure for the multidimensional 0–1 knapsack problem Autor Balev, Stefan, Yanev, Nicola, Fréville, Arnaud, Andonov, Rumen

“… Computational experiments with a set of large-scale instances show the efficiency of our reduction scheme…”
Získať plný text

An effective placement method for the single container loading problem Autor Huang, Yao-Huei, Hwang, F.J., Lu, Hao-Chun

“… length of the occupied space in the container is minimized. Motivated by the practical logistics instances in literature, the problem under study is formulated as a zero-one mixed integer linear programming model…”
Získať plný text

A Lagrangian heuristic for satellite range scheduling with resource constraints Autor Marinelli, Fabrizio, Nocella, Salvatore, Rossi, Fabrizio, Smriglio, Stefano

“… We show that the problem can be formulated as a multiprocessor task scheduling problem in which each job (communication…”
Získať plný text

Solving Airline Crew Scheduling Problems by Branch-and-Cut Autor Hoffman, Karla L, Padberg, Manfred

“… We present a branch-and-cut approach to solving to proven optimality large set partitioning problems arising within the airline industry…”
Získať plný text

IIS branch-and-cut for joint chance-constrained stochastic programs and application to optimal vaccine allocation Autor Tanner, Matthew W., Ntaimo, Lewis

“… The problem can be reformulated as a large-scale mixed 0–1 integer program. We derive a new class of optimality cuts called IIS cuts and apply them to our problem…”
Získať plný text

Effective aircraft maintenance schedule adjustment following incidents Autor Yan, Shangyao, Hsiao, Fei-Yen, Guo, Jyunjhih, Chen, Yu-Ching

“… In tradition, such aircraft maintenance schedule adjustment has been performed manually, a process which is neither effective nor efficient, especially when the problem scale is large…”
Získať plný text

A general algorithm for solving two-stage stochastic mixed 0–1 first-stage problems Autor Escudero, L.F., Garín, M.A., Merino, M., Pérez, G.

“…We present an algorithmic approach for solving large-scale two-stage stochastic problems having mixed 0…”
Získať plný text

Large-scale zero-one linear programming on distributed workstations Autor Cannon, Timothy Lon

“…Minicomputer workstations connected by an Ethernet network have been used to solve large-scale zero-one integer programming problems…”
Získať plný text

On BFC-MSMIP strategies for scenario cluster partitioning, and twin node family branching selection and bounding for multistage stochastic mixed integer programming Autor Escudero, Laureano F., Araceli Garín, María, Merino, María, Pérez, Gloria

“…In the branch-and-fix coordination ( BFC-MSMIP) algorithm for solving large-scale multistage stochastic mixed integer programming problems, we find it crucial…”
Získať plný text

Integer Linear Programming Models for Global Routing Autor Behjat, Laleh, Vannelli, Anthony, Rosehart, William

“… Due to the sheer complexity of the problem, optimizing the connectivity between transistors is very difficult…”
Získať plný text

Cutting plane algorithms for 0-1 programming based on cardinality cuts Autor Oguz, Osman

“… Our computational experimentations demonstrate that this new approach has significant potential for solving large scale integer programming problems…”
Získať plný text

A theoretical and empirical investigation on the Lagrangian capacities of the 0-1 multidimensional knapsack problem Autor Yoon, Yourim, Kim, Yong-Hyuk, Moon, Byung-Ro

“… capacity suitable to the 0-1 multidimensional knapsack problem and present its new geometric equivalent condition including a new associated property…”
Získať plný text

Model and algorithms for multi-period sea cargo mix problem Autor Ang, James S.K., Cao, Chengxuan, Ye, Heng-Qing

“… We propose two heuristic algorithms that can solve large scale problems with tens of thousands of decision variables in a short time…”
Získať plný text

Solving large scale crew scheduling problems Autor Chu, Hai D., Gelman, Eric, Johnson, Ellis L.

“…The crew pairing problem is posed as a set partitioning zero-one integer program…”
Získať plný text

A branch-and-cluster coordination scheme for selecting prison facility sites under uncertainty Autor Hernández, Patricio, Alonso-Ayuso, Antonio, Bravo, Fernanda, Escudero, Laureano F., Guignard, Monique, Marianov, Vladimir, Weintraub, Andrés

“… The problem consists of finding locations and sizes of a preset number of new jails and determining where and when to increase the capacity of both new and existing facilities over a time horizon…”
Získať plný text