Journal: Discrete Optimization

Found 150 papers in total
Two-dimensional bin packing with one-dimensional resource augmentation
Two-dimensional bin packing with one-dimensional resource augmentation
2007,
The two-dimensional bin packing problem is a generalization of the classical bin...
On the job rotation problem
On the job rotation problem
2007,
The job rotation problem (JRP) is the following: Given an n × n matrix A over...
A model to optimize placement operations on dual-head placement machines
A model to optimize placement operations on dual-head placement machines
2007,
Dual-head placement machines are important in the assembly of circuit cards because...
Two-machine open shop problem with controllable processing times
Two-machine open shop problem with controllable processing times
2007,
We consider a two-machine open shop problem in which the job processing times are...
Conflict analysis in mixed integer programming
Conflict analysis in mixed integer programming
2007,
Conflict analysis for infeasible subproblems is one of the key ingredients in modern...
Sequential pairing of mixed integer inequalities
Sequential pairing of mixed integer inequalities
2007,
We investigate a scheme, called pairing, for generating new valid inequalities for...
Symmetric integer linear programming: Coloring and small integers
Symmetric integer linear programming: Coloring and small integers
2007,
This paper presents techniques for handling symmetries in integer linear programs...
Improving the feasibility pump
Improving the feasibility pump
2007,
The feasibility pump described by Fischetti, Glover and Lodi, and Bertacco, Fischetti...
Branch-and-price-and-cut on the clique partitioning problem with minimum clique size requirement
Branch-and-price-and-cut on the clique partitioning problem with minimum clique size requirement
2007,
Given a complete graph K n =(V,E) with edge weight c e on each edge, we consider the...
Metric inequalities and the Network Loading Problem
Metric inequalities and the Network Loading Problem
2007,
Given a simple graph G(V,E) and a set of traffic demands between the nodes of G , the...
Using mixed-integer programming to solve power grid blackout problems
Using mixed-integer programming to solve power grid blackout problems
2007,
We consider optimization problems related to the prevention of large-scale cascading...
A feasibility pump heuristic for general mixed-integer problems
A feasibility pump heuristic for general mixed-integer problems
2007,
Finding a feasible solution of a given Mixed-Integer Programming (MIP) model is a very...
On relocation problems with multiple identical working crews
On relocation problems with multiple identical working crews
2006,
The relocation problem was formulated from a public housing project. In its basic...
Balanced home–away assignments
Balanced home–away assignments
2006,
In recent years several approaches for generating sports league schedules have been...
Greedy-type-resistance of combinatorial problems
Greedy-type-resistance of combinatorial problems
2006,
This paper gives a sufficient condition for a combinatorial problem to be greedy-type...
Polyhedral results on single node variable upper-bound flow models with allowed configurations
Polyhedral results on single node variable upper-bound flow models with allowed configurations
2006,
In this paper we investigate the convex hull of single node variable upper-bound flow...
Packing into the smallest square: Worst-case analysis of lower bounds
Packing into the smallest square: Worst-case analysis of lower bounds
2006,
We address the problem of packing a given set of rectangles into the minimum size...
Using fractional primal–dual to schedule split intervals with demands
Using fractional primal–dual to schedule split intervals with demands
2006,
We consider the problem of scheduling jobs that are given as groups of...
Cyclical scheduling and multi-shift scheduling: Complexity and approximation algorithms
Cyclical scheduling and multi-shift scheduling: Complexity and approximation algorithms
2006,
We consider the multiple shift scheduling problem modelled as a covering problem. Such...
Tree decompositions of graphs: Saving memory in dynamic programming
Tree decompositions of graphs: Saving memory in dynamic programming
2006,
We propose a simple and effective heuristic to save memory in dynamic programming on...
A primal–dual method for approximating tree cover with two weights
A primal–dual method for approximating tree cover with two weights
2006,
The tree cover (TC) problem is to compute a minimum weight connected edge set, given a...
Revisiting parametric multi-terminal problems: Maximum flows, minimum cuts and cut-tree computations
Revisiting parametric multi-terminal problems: Maximum flows, minimum cuts and cut-tree computations
2006,
Given an undirected network, the multi-terminal network flows analysis consists in...
Algorithms for time-dependent bicriteria shortest path problems
Algorithms for time-dependent bicriteria shortest path problems
2006,
In this paper we generalize the classical shortest path problem in two ways. We...
Symmetry helps: Bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints
Symmetry helps: Bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints
2006,
When vehicle routing problems with additional constraints, such as capacity or time...
Papers per page: