Keyword: combinatorial optimization

Found 3184 papers in total
Bun splitting: a practical cutting stock problem
Bun splitting: a practical cutting stock problem
2010,
We describe a new hierarchical 2D-guillotine Cutting Stock Problem. In contrast to the...
The small world of efficient solutions: empirical evidence from the bi-objective {0,1}-knapsack problem
The small world of efficient solutions: empirical evidence from the bi-objective {0,1}-knapsack problem
2010,
The small world phenomenon, Milgram (1967) has inspired the study of real networks...
A pre-assignment heuristic algorithm for the Master Surgical Schedule Problem (MSSP)
A pre-assignment heuristic algorithm for the Master Surgical Schedule Problem (MSSP)
2010,
In this paper a 0–1 linear programming model and a solution heuristic algorithm...
A computational study of exact knapsack separation for the generalized assignment problem
A computational study of exact knapsack separation for the generalized assignment problem
2010,
The Generalized Assignment Problem is a well-known NP-hard combinatorial optimization...
A randomized algorithm for the min-max selecting items problem with uncertain weights
A randomized algorithm for the min-max selecting items problem with uncertain weights
2009,
This paper deals with the min-max version of the problem of selecting p items of the...
Hybrid genetic algorithm and linear programming method for least-cost design of water distribution systems
Hybrid genetic algorithm and linear programming method for least-cost design of water distribution systems
2010,
The problems involved in the optimal design of water distribution networks belong to a...
A simple greedy algorithm for a class of shuttle transportation problems
A simple greedy algorithm for a class of shuttle transportation problems
2009,
Greedy algorithms for combinatorial optimization problems are typically direct and...
2-Commodity integer network synthesis problem
2-Commodity integer network synthesis problem
2009,
We consider the following 2-commodity, integer network synthesis problem: Given two...
Near-optimal feature selection for large databases
Near-optimal feature selection for large databases
2009,
We analyse a new optimization-based approach for feature selection that uses the...
Estimation-Based Local Search for Stochastic Combinatorial Optimization Using Delta Evaluations: A Case Study on the Probabilistic Traveling Salesman Problem
Estimation-Based Local Search for Stochastic Combinatorial Optimization Using Delta Evaluations: A Case Study on the Probabilistic Traveling Salesman Problem
2008,
In recent years, much attention has been devoted to the development of metaheuristics...
Conditions that obviate the no-free-lunch theorems for optimization
Conditions that obviate the no-free-lunch theorems for optimization
2007,
Roughly speaking, the no–free–lunch (NFL) theorems state that any blackbox...
A branch-and-price algorithm for scheduling sport leagues
A branch-and-price algorithm for scheduling sport leagues
2009,
A single round robin tournament can be described as a league of a set T of n teams ( n...
A combinatorial optimization approach for determining composition and sequence of polymers
A combinatorial optimization approach for determining composition and sequence of polymers
2008,
Polymers are compounds formed by the joining of smaller, often repeating, units linked...
Note on the continuity of M-convex and L-convex functions in continuous variables
Note on the continuity of M-convex and L-convex functions in continuous variables
2008,
M–convex and L–convex functions in continuous variables constitute...
Probabilistic analysis of neighbourhood using AR(1) model for combinatorial optimization problems
Probabilistic analysis of neighbourhood using AR(1) model for combinatorial optimization problems
2008,
Metaheuristics are powerful methods used to find approximate solutions for hard...
A new modeling and solution approach for the set-partitioning problem
A new modeling and solution approach for the set-partitioning problem
2008,
The set-partitioning problem (SPP) is widely known for both its application potential...
Solving the swath segment selection problem through Lagrangean relaxation
Solving the swath segment selection problem through Lagrangean relaxation
2008,
The swath segment selection problem (SSSP) is an NP -hard combinatorial optimization...
George Dantzig's impact on the theory of computation
George Dantzig's impact on the theory of computation
2008,
George Dantzig created the simplex algorithm for linear programming, perhaps the most...
A cut and branch approach for the capacitated p-median problem based on Fenchel cutting planes
A cut and branch approach for the capacitated p-median problem based on Fenchel cutting planes
2008,
The capacitated p-median problem (CPMP) consists of finding p nodes (the median nodes)...
Mu1ticriteria tour planning for mobile healthcare facilities in a developing country
Mu1ticriteria tour planning for mobile healthcare facilities in a developing country
2007,
A multiobjective combinatorial optimization (MOCO) formulation for the following...
Labeling algorithm for the shortest path problem with turn prohibitions with application to large-scale road networks
Labeling algorithm for the shortest path problem with turn prohibitions with application to large-scale road networks
2008,
In real road networks, the presence of no-left, no-right or no U-turn signs, restricts...
Fair cost allocations under conflicts: a game-theoretic point of view
Fair cost allocations under conflicts: a game-theoretic point of view
2008,
Optimization theory resolves problems to minimize total costs when the agents are...
A simple heuristic for the optimal enclosed area polygon problem
A simple heuristic for the optimal enclosed area polygon problem
1996,
We present a simple constructive heuristic for the optimal enclosed area polygon...
The shortest multipaths problem in a capacitated dense channel
The shortest multipaths problem in a capacitated dense channel
2007,
In this paper, we present a simple polynomial-time algorithm solving the shortest...
Papers per page: