On the first Chvátal closure of the set covering polyhedron related to circulant matrices Fulltext Access 7 Pages 2013
Approximating connected facility location with buy-at-bulk edge costs via random sampling Fulltext Access 7 Pages 2013
Algorithms to Approximately Count and Sample Conforming Colorings of Graphs Fulltext Access 7 Pages 2013
Obstructions to chordal circular-arc graphs of small independence number Fulltext Access 7 Pages 2013
An inflation algorithm and a toroidal mesh algorithm for edge-bipartite graphs Fulltext Access 7 Pages 2013
An independent set approach for the communication network of the GPS III system Fulltext Access 7 Pages 2013
Some approaches for solving the general (t,k)(t,k)-design existence problem and other related problems Fulltext Access 7 Pages 2013
Upper bounds on the diameter of domination dot-critical graphs with given connectivity Fulltext Access 7 Pages 2013
On the use of multiple sinks to extend the lifetime in connected wireless sensor networks Fulltext Access 8 Pages 2013
Disjunctive combinatorial branch in a subgradient tree algorithm for the DCMST problem with VNS-Lagrangian bounds Fulltext Access 8 Pages 2013
Heuristics for solving a capacitated multiple allocation hub location problem with application in German wagonload traffic Fulltext Access 8 Pages 2013
2-InterConnected Facility Location: Specification, Complexity, and Exact Solutions Fulltext Access 8 Pages 2013
A polynomial formulation for the stochastic maximum weight forest problem Fulltext Access 8 Pages 2013
Strategic planning in LTL logistics – increasing the capacity utilization of trucks Fulltext Access 8 Pages 2013
Branch-and-Price for a European variant of the Railroad Blocking Problem Fulltext Access 8 Pages 2013
Home Care optimization: impact of pattern generation policies on scheduling and routing decisions Fulltext Access 8 Pages 2013
Mathematical Analysis of caching policies and cooperation in YouTube-like services Fulltext Access 8 Pages 2013
A Study of the Connectivity Over Time Behavior of On-Demand Ad Hoc Path Selection Schemes Fulltext Access 8 Pages 2013
Dantzig-Wolfe Reformulation for the Network Pricing Problem with Connected Toll Arcs Fulltext Access 8 Pages 2013
An integer fixed-charge multicommodity flow (FCMF) model for train unit scheduling Fulltext Access 8 Pages 2013
The Degree Preserving Spanning Tree Problem: Valid Inequalities and Branch-and-cut method Fulltext Access 8 Pages 2013
Solving the bi-objective prize-collecting Steiner tree problem with the ϵ-constraint method Fulltext Access 8 Pages 2013
Integer programming models for maximizing parallel transmissions in wireless networks Fulltext Access 8 Pages 2013
Dynamic trees in exterior-point Simplex-type algorithms for network flow problems Fulltext Access 8 Pages 2013
Stronger Lower Bounds for the Quadratic Minimum Spanning Tree Problem with Adjacency Costs Fulltext Access 8 Pages 2013
An Interval Assignment Problem for Resource Optimization in LTE Networks Fulltext Access 8 Pages 2013
Optimizing Toll Enforcement in Transportation Networks: a Game-Theoretic Approach Fulltext Access 8 Pages 2013
A Tabu Search Approach for the Prize Collecting Traveling Salesman Problem Fulltext Access 8 Pages 2013
Minimizing waiting times in a route design problem with multiple use of a single vehicle Fulltext Access 8 Pages 2013
Iterated Local Search for Fiber Installation in Optical Network Optimization Fulltext Access 8 Pages 2013
A new model for multicommodity flow problems, and a strongly polynomial algorithm for single-source Maximum Concurrent Flow Fulltext Access 8 Pages 2013
Solving the Two-Stage Robust FTTH network design Problem under Demand Uncertainty Fulltext Access 8 Pages 2013
Solving the Passive Optical Network with Fiber Duct Sharing Planning Problem Using Discrete Techniques Fulltext Access 8 Pages 2013