Sciweavers

ANOR
2006
101views more  ANOR 2006»
13 years 3 months ago
Comparison of wavelength requirements between two wavelength assignment methods in survivable WDM networks
We consider the routing and wavelength assignment (RWA) in survivable WDM network. A path protection scheme assumed and two different wavelength assignment methods for protection p...
Taehan Lee, Sungsoo Park
ICMAS
2000
13 years 5 months ago
Integer Programming for Combinatorial Auction Winner Determination
Combinatorial auctions are important as they enable bidders to place bids on combinations of items; compared to other auction mechanisms, they often increase the efficiency of the...
Arne Andersson, Mattias Tenhunen, Fredrik Ygge
AAAI
2000
13 years 5 months ago
Computing Circumscriptive Databases by Integer Programming: Revisited
In this paper, we consider a method of computing minimal models in circumscription using integer programming in propositional logic and first-order logic with domain closure axiom...
Ken Satoh, Hidenori Okamoto
RIVF
2008
13 years 5 months ago
On the bounded integer programming
The best upper time bound for solving the Bounded Integer Programming (BIP) up to now is poly()
Thân Quang Khoát
IPCO
2007
140views Optimization» more  IPCO 2007»
13 years 5 months ago
Cuts for Conic Mixed-Integer Programming
A conic integer program is an integer programming problem with conic constraints. Conic integer programming has important applications in finance, engineering, statistical learnin...
Alper Atamtürk, Vishnu Narayanan
CSL
1995
Springer
13 years 7 months ago
Deduction by Combining Semantic Tableaux and Integer Programming
In this paper we propose to extend the current capabilities of automated reasoning systems by making use of techniques from integer programming. We describe the architecture of an ...
Bernhard Beckert, Reiner Hähnle
CPAIOR
2006
Springer
13 years 7 months ago
The Timetable Constrained Distance Minimization Problem
We define the timetable constrained distance minimization problem (TCDMP) which is a sports scheduling problem applicable for tournaments where the total travel distance must be mi...
Rasmus V. Rasmussen, Michael A. Trick
AUSSOIS
2001
Springer
13 years 8 months ago
An Augment-and-Branch-and-Cut Framework for Mixed 0-1 Programming
In recent years the branch-and-cut method, a synthesis of the classical branch-and-bound and cutting plane methods, has proven to be a highly successful approach to solving large-s...
Adam N. Letchford, Andrea Lodi

Publication
518views
15 years 2 months ago
Procurement of Global Logistics Services Using Combinatorial Auction
Global logistics flows have increased dramatically in recent years due to the globalization in the world economy. It is more complex than the domestic logistics, consisting of mult...
Nikesh Kumar Srivastava, N. Viswanadham, and S. Ka...