Results 51 to 60 of about 1,485,911 (189)

A study on exponential-size neighborhoods for the bin packing problem with conflicts

, 2017
We propose an iterated local search based on several classes of local and large neighborhoods for the bin packing problem with conflicts. This problem, which combines the characteristics of both bin packing and vertex coloring, arises in various ...
Capua, Renatha, Frota, Yuri, Ochi, Luiz Satoru, Vidal, Thibaut   +3 more
core   +1 more source

Approximating Node Connectivity Problems via Set Covers

Algorithmica, 2000
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kortsarz, Guy, Nutov, Zeev
openaire   +1 more source

An extension of set partitioning with application to scheduling problems [PDF]

, 1983
The well known problems of set covering, set partitioning and set packing are defined and their interrelationship is considered. A natural generalisation called the extended set partitioning model is presented and the three standard models are shown to ...
Darby-Dowman, K, Mitra, G
core  

A Local Branching Approach for the Set Covering Problem

International Journal of Industrial Engineering and Production Research, 2014
The set covering problem (SCP) is a well-known combinatorial optimization problem. This paper investigates development of a local branching approach for the SCP.
Masoud Yaghini, Mohsen Momeni, Mohammadreza Momeni Sarmadi   +2 more
doaj  

Binary Chaotic White Shark Optimizer for the Unicost Set Covering Problem

Mathematics
The Unicost Set Covering Problem (USCP), an NP-hard combinatorial optimization challenge, demands efficient methods to minimize the number of sets covering a universe.
Pablo Zúñiga-Valenzuela, Broderick Crawford, Felipe Cisternas-Caneo, Eduardo Rodriguez-Tello, Ricardo Soto, José Barrera-Garcia, Fernando Lepe-Silva   +6 more
doaj   +1 more source

Survey of 8 UAV Set-Covering Algorithms for Terrain Photogrammetry

Remote Sensing, 2020
Remote sensing with unmanned aerial vehicles (UAVs) facilitates photogrammetry for environmental and infrastructural monitoring. Models are created with less computational cost by reducing the number of photos required.
Joshua E. Hammond, Cory A. Vernon, Trent J. Okeson, Benjamin J. Barrett, Samuel Arce, Valerie Newell, Joseph Janson, Kevin W. Franke, John D. Hedengren   +8 more
doaj   +1 more source

Exact solutions for the 2d-strip packing problem using the positions-and-covering methodology.

PLoS ONE, 2021
We use the Positions and Covering methodology to obtain exact solutions for the two-dimensional, non-guillotine restricted, strip packing problem. In this classical NP-hard problem, a given set of rectangular items has to be packed into a strip of fixed ...
Nestor M Cid-Garcia, Yasmin A Rios-Solis
doaj   +1 more source

Airline crew scheduling [PDF]

, 1992
An airline must cover each flight leg with a full complement of cabin crew in a manner consistent with safety regulations and award requirements. Methods are investigated for solving the set partitioning and covering problem.
Mills, G.
core  

Recognizing Members of the Tournament Equilibrium Set is NP-hard

, 2008
A recurring theme in the mathematical social sciences is how to select the "most desirable" elements given a binary dominance relation on a set of alternatives.
B Dutta, B Dutta, CH Papadimitriou, D Bouyssou, DC Fisher, F Brandt, F Brandt, Felix Brandt, Felix Fischer, G Laffond, G Laffond, GJ Woeginger, J-F Laslier, JS Banks, Maximilian Mair, N Alon, N Houy, Paul Harrenstein, PC Fishburn, PE Dunne, PM Dung, R Stearns, R Tarjan, T Schwartz   +23 more
core   +4 more sources

Approximation of the Quadratic Set Covering problem

Discrete Optimization, 2007
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Escoffier, Bruno, Hammer, Peter
openaire   +2 more sources