Country: Netherlands

Found 18376 papers in total
A constructive characterization of the split closure of a mixed integer linear program
A constructive characterization of the split closure of a mixed integer linear program
2007,
Two independent proofs of the polyhedrality of the split closure of mixed integer...
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...
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...
Improving the feasibility pump
Improving the feasibility pump
2007,
The feasibility pump described by Fischetti, Glover and Lodi, and Bertacco, Fischetti...
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...
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...
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...
Note on the applicability of the Vickrey–Clarke–Groves (VCG) mechanism to capacitated assignment problems and extensions
Note on the applicability of the Vickrey–Clarke–Groves (VCG) mechanism to capacitated assignment problems and extensions
2007,
For the allocation of heterogeneous items, it is known that the buyers-are-substitutes...
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...
Computing a maxian point of a simple rectilinear polygon
Computing a maxian point of a simple rectilinear polygon
2007,
Let P be a simple rectilinear polygon with n vertices. There are k points in P . The...
The capacitated arc routing problem with refill points
The capacitated arc routing problem with refill points
2007,
This article introduces the capacitated arc routing problem with refill points. The...
Heuristic estimates in shortest path algorithms
Heuristic estimates in shortest path algorithms
2007,
Shortest path problems occupy an important position in operations research as well as...
On the disjoint paths problem
On the disjoint paths problem
2007,
Using flow and matching algorithms to solve the problem of finding disjoint paths...
Counting the number of renewals during a random interval in a discrete-time delayed renewal process
Counting the number of renewals during a random interval in a discrete-time delayed renewal process
2007,
In a discrete-time delayed renewal process, we study the distribution of the number of...
Design of trees in the hose model: The balanced case
Design of trees in the hose model: The balanced case
2006,
In the hose model we are given upper bounds b − u /b + u on the amount of...
Optimality in Feller semi-Markov control processes
Optimality in Feller semi-Markov control processes
2006,
Semi-Markov control processes with Borel state space and Feller transition...
The robust minimum spanning tree problem: Compact and convex uncertainty
The robust minimum spanning tree problem: Compact and convex uncertainty
2007,
We consider the robust minimum spanning tree problem where edges costs are on a...
The stable set problem and the thinness of a graph
The stable set problem and the thinness of a graph
2007,
We introduce a poly-time algorithm for the maximum weighted stable set problem, when a...
Minimal N+-rank graphs: Progress on Lipták and Tunçel's conjecture
Minimal N+-rank graphs: Progress on Lipták and Tunçel's conjecture
2006,
We analyze Lipták and Tunçel's conjecture on minimal graphs with N...
Direct graph k-partitioning with a Kernighan–Lin like heuristic
Direct graph k-partitioning with a Kernighan–Lin like heuristic
2006,
We show that the Kernighan–Lin like linear time heuristic for bipartitioning...
Source location with rigidity and tree packing requirements
Source location with rigidity and tree packing requirements
2006,
We consider the following two problems: (i) given a graph, find a minimum size...
Two new models for determining ordered weighted averaging operator weights
Two new models for determining ordered weighted averaging operator weights
2007,
The determination of ordered weighted averaging (OWA) operator weights is a very...
Quantitative expression and aggregation of performance measurements based on the MACBETH multi-criteria method
Quantitative expression and aggregation of performance measurements based on the MACBETH multi-criteria method
2007,
This study deals with the use of the MACBETH methodology as a global framework for...
Partial inverse assignment problems under l1 norm
Partial inverse assignment problems under l1 norm
2007,
In this paper, we consider the partial inverse assignment problem under l 1 norm...
Papers per page: