Keyword: programming: integer

Found 3058 papers in total
Integrated planning of acquisition, disassembly and bulk recycling: a case study on electronic scrap recovery
Integrated planning of acquisition, disassembly and bulk recycling: a case study on electronic scrap recovery
2003,
Due to national and supranational legislation activities, the recovery of discarded...
Optimization in forestry
Optimization in forestry
2003,
Optimization models and methods have been used extensively in the forest industry. In...
A problem of forest harvesting and road building solved through model strengthening and Lagrangean relaxation
A problem of forest harvesting and road building solved through model strengthening and Lagrangean relaxation
2003,
We consider a problem of forest planning on pine plantations over a two to five year...
Mathematical model for the dispatch of public buses
Mathematical model for the dispatch of public buses
2002,
This paper analyses the dispatch of public buses – a question from College...
The mixed general routing polyhedron
The mixed general routing polyhedron
2003,
In Arc Routing Problem, ARPs, the aim is to find on a graph a minimum cost traversal...
A fast approximation algorithm for the subset-sum problem
A fast approximation algorithm for the subset-sum problem
2002,
The subset-sum problem (SSP) is defined as follows: given a positive integer bound and...
Properties of an interior-point mapping for mixed complementarity problems
Properties of an interior-point mapping for mixed complementarity problems
1996,
Using a unified theory of local homeomorphic maps, we establish some basic properties...
Decomposition of test sets in stochastic integer programming
Decomposition of test sets in stochastic integer programming
2003,
We study Graver test sets for linear two-stage stochastic integer programs and show...
On the separation of split cuts and related inequalities
On the separation of split cuts and related inequalities
2003,
The split cuts of Cook, Kannan and Schrijver are general-purpose valid inequalities...
The merchant subtour problem
The merchant subtour problem
2003,
We consider the problem of a travelling merchant who makes money by buying commodities...
Minimising total average cycle stock subject to practical constraints
Minimising total average cycle stock subject to practical constraints
2003,
Silver and Moon address the problem of minimising total average cycle stock subject to...
Lot sizing problems with strong set-up interactions
Lot sizing problems with strong set-up interactions
1997,
We address the problem of coordinated replenishment of products when the products can...
On the polyhedral structure of a multi-item production model with setup times
On the polyhedral structure of a multi-item production model with setup times
2003,
We present and study a mixed integer programming model that arises as a substructure...
A multi-item production planning model with setup times: Algorithms, reformulations, and polyhedral characterizations for a special case
A multi-item production planning model with setup times: Algorithms, reformulations, and polyhedral characterizations for a special case
2003,
We study a special case of a structured mixed integer programming model that arises in...
A note on clique-web facets for multicut polytopes
A note on clique-web facets for multicut polytopes
2002,
In this note we provide a previously undiscovered necessary condition for the...
The stable allocation (or ordinal transportation) problem
The stable allocation (or ordinal transportation) problem
2002,
The stable allocation problem generalizes the 0,1 stable matching problems...
An empirical study for satisfiability problems in propositional logic using set covering formulation
An empirical study for satisfiability problems in propositional logic using set covering formulation
2002,
A satisfiability problem in propositional logic is the problem of checking for the...
Integral polyhedra related to even-cycle and even-cut matroids
Integral polyhedra related to even-cycle and even-cut matroids
2002,
A family of sets ℋ is ideal if the polyhedron {x ≥ 0 : Σ i∈S x i...
Least trimmed squares regression, least median squares regression, and mathematical programming
Least trimmed squares regression, least median squares regression, and mathematical programming
2002,
In this paper, we study LTS and LMS regression, two high breakdown regression...
Minimizing breaks by maximizing cuts
Minimizing breaks by maximizing cuts
2003,
We propose to solve the break minimization problem in sports scheduling by...
A combinatorial multicriteria approach for corporate funding under policy restrictions
A combinatorial multicriteria approach for corporate funding under policy restrictions
2001,
Multiple Criteria Decision Aid methods are increasingly used in financial decision...
Building and Solving Mathematical Programming Models in Engineering and Science
Building and Solving Mathematical Programming Models in Engineering and Science
2002,
A multicommodity network-flow problem with side constraints on paths solved by column generation
A multicommodity network-flow problem with side constraints on paths solved by column generation
2003,
The multicommodity network-flow model concerns routing of a number of commodities...
Lower bounds in lot-sizing models: A polyhedral study
Lower bounds in lot-sizing models: A polyhedral study
1998,
Variable lower bounds in Mixed Integer Programs are constraints with the general form...
Papers per page: