Results 1  10
of
2,469,980
A Lagrangianbased Heuristic for Largescale Set Covering Problems
 Mathematical Programming
, 1995
"... We present a new Lagrangianbased heuristic for solving largescale setcovering problems arising from crewscheduling at the Italian Railways (Ferrovie dello Stato). Our heuristic obtained impressive results when compared to state of the art codes on a testbed provided by the company, which includ ..."
Abstract

Cited by 38 (0 self)
 Add to MetaCart
We present a new Lagrangianbased heuristic for solving largescale setcovering problems arising from crewscheduling at the Italian Railways (Ferrovie dello Stato). Our heuristic obtained impressive results when compared to state of the art codes on a testbed provided by the company, which
Advanced OR and AI Methods in Transportation LARGESCALE SET PARTITIONING PROBLEMS: CONJECTURES ON THE BENEFICIAL STRUCTURE OF SOME REALWORLD INSTANCES
"... Abstract. In this work we consider largescale set partitioning problems. Our main purpose is to show that realworld set partitioning problems originating from the containertrucking industry are easier to tackle with respect to general ones. We show such different behavior through computational ex ..."
Abstract
 Add to MetaCart
Abstract. In this work we consider largescale set partitioning problems. Our main purpose is to show that realworld set partitioning problems originating from the containertrucking industry are easier to tackle with respect to general ones. We show such different behavior through computational
LARGESCALE SET PARTITIONING PROBLEMS: SOME REALWORLD INSTANCES HIDE A BENEFICIAL STRUCTURE
, 2005
"... Abstract. In this paper we consider largescale set partitioning problems. Our main purpose is to show that realworld set partitioning problems originating from the containertrucking industry are easier to tackle in respect to general ones. We show such different behavior through computational exp ..."
Abstract
 Add to MetaCart
Abstract. In this paper we consider largescale set partitioning problems. Our main purpose is to show that realworld set partitioning problems originating from the containertrucking industry are easier to tackle in respect to general ones. We show such different behavior through computational
An Evolutionary Algorithm for Large Scale Set Covering Problems with Application to Airline Crew Scheduling
 Scheduling, in Real World Applications of Evolutionary Computing. SpringerVerlag, Lecture Notes in Computer Science
, 2000
"... . The set covering problem is a paradigmatic NPhard combinatorial optimization problem which is used as model in relevant applications, in particular crew scheduling in airline and masstransit companies. This paper is concerned with the approximated solution of large scale set covering problems ar ..."
Abstract

Cited by 15 (3 self)
 Add to MetaCart
. The set covering problem is a paradigmatic NPhard combinatorial optimization problem which is used as model in relevant applications, in particular crew scheduling in airline and masstransit companies. This paper is concerned with the approximated solution of large scale set covering problems
A Combined Lagrangian, Linear Programming and Implication Heuristic for LargeScale Set Partitioning Problems
 Journal of Heuristics
, 1995
"... Given a finite ground set, a set of subsets and costs on the subsets, the set partitioning problem is to find a minimum cost partition of the ground set. Many combinatorial optimization problems can be formulated as set partitioning problems. We present an approximation algorithm that produces high ..."
Abstract

Cited by 21 (3 self)
 Add to MetaCart
Given a finite ground set, a set of subsets and costs on the subsets, the set partitioning problem is to find a minimum cost partition of the ground set. Many combinatorial optimization problems can be formulated as set partitioning problems. We present an approximation algorithm that produces high
A Combined Lagrangian, and Implication Heuristic Partitioning Problems Linear Programming, for LargeScale Set partitioning problems
, 1995
"... Given a finite ground set, a set of subsets, and costs on the subsets, the set partitioning problem is to find a minimum cost partition of the ground set. Many combinatorial optimization problems can be formulated as set partitioning problems. We present an approximation algorithm that produces high ..."
Abstract
 Add to MetaCart
Given a finite ground set, a set of subsets, and costs on the subsets, the set partitioning problem is to find a minimum cost partition of the ground set. Many combinatorial optimization problems can be formulated as set partitioning problems. We present an approximation algorithm that produces
A Flexible Hybrid Concurrency Control Model for Collaborative Applications in Large Scale Settings
 J.Di#erential Equations
, 1996
"... Largescale collaborative applications are difficult to build because of their high concurrency control needs and the heterogeneity of the underlying architecture. Due to these difficulties, only a few largescale applications have been developed, such as Usenet or irc. To facilitate the realisation ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Largescale collaborative applications are difficult to build because of their high concurrency control needs and the heterogeneity of the underlying architecture. Due to these difficulties, only a few largescale applications have been developed, such as Usenet or irc. To facilitate
A Parallel, Linear Programming Based Heuristic for Large Scale Set Partitioning Problems
, 2000
"... We describe a parallel, linear programming and implication based heuristic for solving set partitioning problems on distributed memory computer architectures. Our implementation is carefully designed to exploit parallelism to greatest advantage in advanced techniques like preprocessing and probing, ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
We describe a parallel, linear programming and implication based heuristic for solving set partitioning problems on distributed memory computer architectures. Our implementation is carefully designed to exploit parallelism to greatest advantage in advanced techniques like preprocessing and probing
Results 1  10
of
2,469,980