Keyword: programming: integer

Found 3058 papers in total
Robust ranking and portfolio optimization
Robust ranking and portfolio optimization
2012,
The portfolio optimization problem has attracted researchers from many disciplines to...
Two‐echelon, multi‐commodity supply chain network design with mode selection, lead‐times and inventory costs
Two‐echelon, multi‐commodity supply chain network design with mode selection, lead‐times and inventory costs
2012,
We have formulated the problem as a mixed integer programming model, which integrates...
An integer programming formulation for the project scheduling problem with irregular time–cost tradeoffs
An integer programming formulation for the project scheduling problem with irregular time–cost tradeoffs
2012,
Four integer programming formulations are studied for the irregular costs project...
Synchronized arc routing for snow plowing operations
Synchronized arc routing for snow plowing operations
2012,
This paper introduces a synchronized arc routing problem for snow plowing operations....
Mathematical models for preemptive shop scheduling problems
Mathematical models for preemptive shop scheduling problems
2012,
More than half a century has passed since Bowman and Dantzig (1959) introduced their...
On the separation in 2‐period double round robin tournaments with minimum breaks
On the separation in 2‐period double round robin tournaments with minimum breaks
2012,
This paper considers the separation in 2‐period double round robin tournaments...
Sample Spaces with Small Bias on Neighborhoods and Error‐Correcting Communication Protocols
Sample Spaces with Small Bias on Neighborhoods and Error‐Correcting Communication Protocols
2001,
We give a deterministic algorithm which, on input an integer n , collection \cal F of...
Multi‐index transport problems with decomposition structure
Multi‐index transport problems with decomposition structure
2012,
Consideration was given to the multi‐index problems of linear and integer...
Kernel Search: a new heuristic framework for portfolio selection
Kernel Search: a new heuristic framework for portfolio selection
2012,
In this paper we propose a new heuristic framework, called Kernel Search, to solve the...
Semi‐Lagrangian relaxation applied to the uncapacitated facility location problem
Semi‐Lagrangian relaxation applied to the uncapacitated facility location problem
2012,
We show how the performance of general purpose Mixed Integer Programming (MIP)...
A branch‐and‐price approach for harvest scheduling subject to maximum area restrictions
A branch‐and‐price approach for harvest scheduling subject to maximum area restrictions
2012,
Recently, research on exact methods has been undertaken to solve forest management...
Improving an exact approach for solving separable integer quadratic knapsack problems
Improving an exact approach for solving separable integer quadratic knapsack problems
2012,
We consider the specially structured (pure) integer Quadratic Multi‐Knapsack...
Combinatorial algorithms for the maximum k‐plex problem
Combinatorial algorithms for the maximum k‐plex problem
2012,
The maximum clique problem provides a classic framework for detecting cohesive...
Solving haplotype inference problem with non‐genotyped founders via integer linear programming
Solving haplotype inference problem with non‐genotyped founders via integer linear programming
2012,
In Cheng et al. (2009), the authors present a cubic time zero‐recombination...
Solving survivable two‐layer network design problems by metric inequalities
Solving survivable two‐layer network design problems by metric inequalities
2012,
We address the problem of designing a multi‐layer network with survivability...
An integer programming approach to elective surgery scheduling
An integer programming approach to elective surgery scheduling
2012,
The scope of this work covers a real case of elective surgery planning in a Lisbon...
A function approximation approach to the segmentation step in IMRT planning
A function approximation approach to the segmentation step in IMRT planning
2012,
In the segmentation step of intensity modulated radiation therapy planning, given...
Joint job scheduling and preventive maintenance on a single machine
Joint job scheduling and preventive maintenance on a single machine
2012,
This paper considers the integration of production scheduling and preventive...
Packing cycles exactly in polynomial time
Packing cycles exactly in polynomial time
2012,
Let G =( V , E ) be an undirected graph in which every vertex v ∈ V is assigned a...
Models for the single‐vehicle preemptive pickup and delivery problem
Models for the single‐vehicle preemptive pickup and delivery problem
2012,
In this paper, we study a variant of the well‐known single‐vehicle...
Curriculum based course timetabling: new solutions to Udine benchmark instances
Curriculum based course timetabling: new solutions to Udine benchmark instances
2012,
We present an integer programming approach to the university course timetabling...
An IP‐based heuristic for the post enrolment course timetabling problem of the ITC2007
An IP‐based heuristic for the post enrolment course timetabling problem of the ITC2007
2012,
Track 2 of the international timetabling competition 2007 was a post enrolment course...
Strong bounds with cut and column generation for class‐teacher timetabling
Strong bounds with cut and column generation for class‐teacher timetabling
2012,
This work presents an integer programming formulation for a variant of the...
A branch‐and‐cut procedure for the Udine Course Timetabling problem
A branch‐and‐cut procedure for the Udine Course Timetabling problem
2012,
A branch‐and‐cut procedure for the Udine Course Timetabling problem is...
Papers per page: