Keyword: graphs

Found 1175 papers in total
An optimization approach to plan for reusable software components
An optimization approach to plan for reusable software components
2002,
It is well acknowledged in software engineering that there is a great potential for...
Implementing real-time optimization models: A case application from the motor carrier industry
Implementing real-time optimization models: A case application from the motor carrier industry
2002,
Online models for real-time operations planning face a host of implementation issues...
Review of properties of different precedence graphs for scheduling problems
Review of properties of different precedence graphs for scheduling problems
2002,
Precedence constraints are a part of a definition of any scheduling problem. After...
A generalized class–teacher model for some timetabling problems
A generalized class–teacher model for some timetabling problems
2002,
We consider a theoretical model which extends the basic ‘class–teacher...
An n-tet graph approach for non-guillotine packings of n-dimensional boxes into an n-container
An n-tet graph approach for non-guillotine packings of n-dimensional boxes into an n-container
2002,
In this paper we propose a simple recursive uniform algorithm for the problem of...
Modelling competitive Hopfield networks for the maximum clique problem
Modelling competitive Hopfield networks for the maximum clique problem
2003,
The maximum clique problem (MCP) is a classic graph optimization problem with many...
Solving integer programs over monotone inequalities in three variables: A framework for half integrality and good approximations
Solving integer programs over monotone inequalities in three variables: A framework for half integrality and good approximations
2002,
We define a class of monotone integer programs with constraints that involve up to...
On Grötschel–Lovász–Shrijver's relaxation of stable set polytopes
On Grötschel–Lovász–Shrijver's relaxation of stable set polytopes
2002,
Grötschel, Lovász and Schrijver introduced a convex set containing the...
An algorithm for the travelling salesman problem
An algorithm for the travelling salesman problem
2001,
We present an algorithm for the travelling salesman problem using the method of...
The condition that the minimum Hamiltonian cycle is an optimal traveling salesman route
The condition that the minimum Hamiltonian cycle is an optimal traveling salesman route
2001,
In this paper, we prove that the necessary and sufficient condition of minimum...
Bag rationalisation for a food manufacturer
Bag rationalisation for a food manufacturer
2002,
A food manufacturer has decided to rationalise the types of bags used to pack their...
Optimal parallel processing of random task graphs
Optimal parallel processing of random task graphs
2001,
We consider scheduling of tasks of parallel programs on multiprocessor systems where...
The bottleneck mechanism of a freeway diverge
The bottleneck mechanism of a freeway diverge
2002,
This paper describes the behavior of multi-lane freeway traffic, upstream of an...
A new rounding procedure for the assignment problem with applications to dense graph arrangement problems
A new rounding procedure for the assignment problem with applications to dense graph arrangement problems
2002,
We present a randomized procedure for rounding fractional perfect matchings to...
An efficient broadcast scheduling algorithm for time division multiple access ad-hoc networks
An efficient broadcast scheduling algorithm for time division multiple access ad-hoc networks
2002,
In this paper, we propose an efficient algorithm to find a collision-free time slot...
Fuzzy interval and semi-orders
Fuzzy interval and semi-orders
2002,
The seminal paper by Luce on intransitive indifference provoked a rich body of...
Finding minimal branchings with a given number of arcs
Finding minimal branchings with a given number of arcs
2002,
We describe an algorithm for finding a minimal s -branching (where s is a given number...
Approximation algorithms for degree-constrained minimum-cost network-design problems
Approximation algorithms for degree-constrained minimum-cost network-design problems
2001,
We study network-design problems with two different design objectives: the total cost...
The cable trench problem: Combining the shortest path and minimum spanning tree problems
The cable trench problem: Combining the shortest path and minimum spanning tree problems
2002,
Let G = (V, E) be a connected graph with specified vertex υ 0 ∈ V , length...
On the linear description of the 3-cycle polytope
On the linear description of the 3-cycle polytope
2002,
Let K n be the complete undirected graph with n vertices. A 3-cycle is a simple cycle...
Solving some lexicographic multi-objective combinatorial problems
Solving some lexicographic multi-objective combinatorial problems
2002,
The lexicographic multi-objective optimization problem ( r -LMOP) with r (sum or...
Quadratic integer programming with application to the chaotic mappings of complete multipartite graphs
Quadratic integer programming with application to the chaotic mappings of complete multipartite graphs
2001,
In this paper, we study the chaotic mappings of complete multipartite graphs. The...
Combinatorial methods in network reliability analysis
Combinatorial methods in network reliability analysis
2000,
In this paper, a stochastic network is an undirected graph with unreliable edges and...
Reasoning with contextual graphs
Reasoning with contextual graphs
2002,
Decision trees allow the modeling of event-dependent reasoning, but do not consider...
Papers per page: