Sign in
Author

Conference

Journal

Organization

Year

DOI
Look for results that meet for the following criteria:
since
equal to
before
between
and
Search in all fields of study
Limit my searches in the following fields of study
Agriculture Science
Arts & Humanities
Biology
Chemistry
Computer Science
Economics & Business
Engineering
Environmental Sciences
Geosciences
Material Science
Mathematics
Medicine
Physics
Social Science
Multidisciplinary
Keywords
(1)
Combinatorial Optimization
Related Publications
(36)
Introduction to combinatorial mathematics
Dynamic Programming and Markov Processes
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
Network flows  theory, algorithms and applications
An algorithm for distinct representatives
Subscribe
Academic
Publications
Combinatorial optimization: networks and matroids
Combinatorial optimization: networks and matroids,E. Lawler
Edit
Combinatorial optimization: networks and matroids
(
Citations: 755
)
BibTex

RIS

RefWorks
Download
E. Lawler
Published in 1976.
Cumulative
Annual
Citation Context
(254)
...Some link elimination approaches ensure that the
k
least cost paths are found (Lawler
1976
, van der Zijpp and FiorenzoCatalano
2005
), while others only accept paths within constraints such as maximum amount of overlap with other paths or a maximum detour time (van der Zijpp and FiorenzoCatalano
2005
)...
Nadine RieserSchüssler
,
et al.
Route choice sets for very highresolution data
...On the other hand, in cases of the problems of SMT in graphs, a wellknown method was presented by Lawler (
1976
), where the concepts of complete graph (CG) and minimum spanning tree (MST) were used in conjunction to solve this problem; however, the main disadvantages of this method are exponential computations with the increase of nodes number in a graph...
Qiang Liu
,
et al.
Multiterminal pipe routing by Steiner minimal tree and particle swarm ...
...Although it is not clear whether the Monge property [1, 2, 26] holds for our particular klink shortest path problem, this problem is solvable in a much faster manner than a straightforward klink shortest path algorithm on general graphs [
23
]...
Nikhil Bansal
,
et al.
Shape Rectangularization Problems in IntensityModulated Radiation The...
...The noncumulative minimization problem on a matroid can be solved to optimality by the standard greedy algorithm [
9
]...
Igor Averbakh
,
et al.
The flowtime network construction problem
...
Lawler (1976)
...
A. H. M. Shamsuzzoha
,
et al.
Information dependencies within product architecture: prospects of com...
Sort by:
Citations
(755)
Route choice sets for very highresolution data
(
Citations: 2
)
Nadine RieserSchüssler
,
Michael Balmer
,
Kay W. Axhausen
Journal:
Transportmetrica
, vol. aheadofp, no. aheadofp, pp. 121, 2012
Multiterminal pipe routing by Steiner minimal tree and particle swarm optimisation
Qiang Liu
,
Chengen Wang
Journal:
Enterprise Information Systems  ENTERP INF SYST
, vol. 6, no. 3, pp. 315327, 2012
A survey of scheduling problems with late work criteria
(
Citations: 2
)
Malgorzata Sterna
Journal:
Omegainternational Journal of Management Science  OMEGAINT J MANAGE SCI
, vol. 39, no. 2, pp. 120129, 2011
Shape Rectangularization Problems in IntensityModulated Radiation Therapy
Nikhil Bansal
,
Danny Z. Chen
,
Don Coppersmith
,
Xiaobo Sharon Hu
,
Shuang Luan
,
Ewa Misiolek
,
Baruch Schieber
,
Chao Wang
Journal:
Algorithmica
, vol. 60, no. 2, pp. 421450, 2011
Bee colony optimization for the pcenter problem
Tatjana Davidovic
,
Dusan Ramljak
,
Milica Selmic
,
Dusan Teodorovic
Journal:
Computers & Operations Research  CoR
, vol. 38, no. 10, pp. 13671376, 2011