Keyword: combinatorial optimization

Found 3184 papers in total
Doubly-rooted stem-and-cycle ejection chain algorithm for the asymmetric traveling salesman problem
Doubly-rooted stem-and-cycle ejection chain algorithm for the asymmetric traveling salesman problem
2016,
Ejection chain methods, which include the classical Lin–Kernighan (LK) procedure...
Partial target coverage to extend the lifetime in wireless multi-role sensor networks
Partial target coverage to extend the lifetime in wireless multi-role sensor networks
2016,
This article studies the effect of partial coverage to extend the lifetime of wireless...
Mathematical models and empirical analysis of a simulated annealing approach for two variants of the static data segment allocation problem
Mathematical models and empirical analysis of a simulated annealing approach for two variants of the static data segment allocation problem
2016,
We consider a content distribution network (CDN) in which data hubs or servers are...
Heuristics for a hub location-routing problem
Heuristics for a hub location-routing problem
2016,
We investigate a variant of the many‐to‐many hub location‐routing...
Locating depots for capacitated vehicle routing
Locating depots for capacitated vehicle routing
2016,
We study a location‐routing problem in the context of capacitated vehicle...
The ring/κ-rings network design problem: Model and branch-and-cut algorithm
The ring/κ-rings network design problem: Model and branch-and-cut algorithm
2016,
This article considers the problem of designing a two‐level network where the...
A characterization of irreducible infeasible subsystems in flow networks
A characterization of irreducible infeasible subsystems in flow networks
2016,
Infeasible network flow problems with supplies and demands can be characterized via...
Multi-Unit Bayesian Auction with Demand or Budget Constraints
Multi-Unit Bayesian Auction with Demand or Budget Constraints
2016,
We consider the problem of revenue maximization on multi‐unit auctions where...
Robust capacity expansion of a network under demand uncertainty: A bi-objective approach
Robust capacity expansion of a network under demand uncertainty: A bi-objective approach
2016,
This paper deals with the problem of capacity expansion of a network under independent...
A branch-and-cut-and-price algorithm for the mixed capacitated general routing problem
A branch-and-cut-and-price algorithm for the mixed capacitated general routing problem
2016,
In this paper, we consider the Mixed Capacitated General Routing Problem which is a...
The driver assignment vehicle routing problem
The driver assignment vehicle routing problem
2016,
We introduce the driver assignment vehicle routing problem, DAVRP. In this problem,...
Robust models for linear programming with uncertain right hand side
Robust models for linear programming with uncertain right hand side
2016,
We propose new robust models for handling right hand side uncertainty in linear...
A linear mathematical model for a transportation-inventory problem in a two-stage supply chain with different types of fuels for vehicles
A linear mathematical model for a transportation-inventory problem in a two-stage supply chain with different types of fuels for vehicles
2016,
Transportation and inventory challenges are classic problems which have been taken...
Two-warehouse inventory model for non-instantaneous deteriorating items with stock dependent demand, partial backlogging and inflation over a finite time horizon
Two-warehouse inventory model for non-instantaneous deteriorating items with stock dependent demand, partial backlogging and inflation over a finite time horizon
2016,
In this paper, two‐warehouse economic order quantity (EOQ) model for...
Scheduling comparison between multi-objective mathematical models and genetic algorithms approach in the textile industry
Scheduling comparison between multi-objective mathematical models and genetic algorithms approach in the textile industry
2016,
This paper discusses mixed integer mathematical models and genetic algorithms...
The Rainbow Cycle Cover Problem
The Rainbow Cycle Cover Problem
2016,
We model and solve the Rainbow Cycle Cover Problem (RCCP). Given a connected and...
Minimum bottleneck spanning trees with degree bounds
Minimum bottleneck spanning trees with degree bounds
2016,
Given a graph G with edge lengths, the minimum bottleneck spanning tree (MBST) problem...
Designing networks: A mixed-integer linear optimization approach
Designing networks: A mixed-integer linear optimization approach
2016,
Designing networks with specified collective properties is useful in a variety of...
The bottleneck selected-internal and partial terminal Steiner tree problems
The bottleneck selected-internal and partial terminal Steiner tree problems
2016,
Given a complete graph G = ( V , E ) , a positive length function on edges, and two...
Mixed planar and network single-facility location problems
Mixed planar and network single-facility location problems
2016,
We consider the problem of optimally locating a single facility anywhere in a network...
Dynamic shortest-path interdiction
Dynamic shortest-path interdiction
2016,
We study a dynamic network game between an attacker and a user. The user wishes to...
What is Middle Maintenance Policy?
What is Middle Maintenance Policy?
2016,
The main purpose of this paper is to propose several new maintenance policies that can...
A Fast and Accurate Feature Selection Algorithm Based on Binary Consistency Measure
A Fast and Accurate Feature Selection Algorithm Based on Binary Consistency Measure
2016,
Consistency‐based feature selection is an important category of feature...
Dynamic parallel machine scheduling with random breakdowns using the learning agent
Dynamic parallel machine scheduling with random breakdowns using the learning agent
2016,
Agent technology has been widely applied in the manufacturing process due to its...
Papers per page: