A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is `application/pdf`

.

## Filters

##
###
On Freight Network Design Problem

貨物輸送における網構築問題に関する研究

1992
*
Journal of Japan Logistics Society
*

貨物輸送における網構築問題に関する研究

We formulate this

doi:10.11285/logisticssociety1992.1992.21
fatcat:ctem34rcmbhrngdsxok4a7qo4e
*problem*as*a*nonlinear programming*problem**and*develop*a*composite*algorithm*of lower*and*upper*bounding*procedures using Lagrangean relaxation technique. ... Our numerical experiments with up to 40 nodes*for*layered*network**problems**and*50 nodes*for*general*network**problems*show that our*algorithm*generates good solutions within reasonable computational time ... Soland [16] proposed*a**branch**and**bound**algorithm**for*the solution of the*concave*cost plant location*problem*. ...##
###
A SIMPLICIAL BRANCH-AND-BOUND ALGORITHM FOR PRODUCTION-TRANSPORTATION PROBLEMS WITH INSEPARABLE CONCAVE PRODUCTION COST

2005
*
Journal of the Operations Research Society of Japan
*

In this paper, we develop

doi:10.15807/jorsj.48.97
fatcat:5esvjvhdzjajvoiuo2wti3n4r4
*a**branch*-*and*-*bound**algorithm*to selve*a**network**flow*problerr} of' optimizing production*and*transportation simultaneously. ... We also report some computatiorial resurts, which indi¢ ate that the*algorithm*is fairly promising*for*practical use. ... op*a**branch*-*and*-*bound**algorithm*to solve this*concave*cost*network**flow**problem*. Unlike the existing*algorithms*, we do not impose the separability assumption on the production cost. ...##
###
Page 1612 of Mathematical Reviews Vol. , Issue 87c
[page]

1987
*
Mathematical Reviews
*

87¢:90077
ing

*problem*solved by simplex*and**branch*-*and*-*bound*; columns are generated by*a*shortest path*algorithm*with time constraints on the nodes. (2) Adaptation of the Carpaneto-Toth*algorithm**for*the ... We discuss the*network*equilibrium*problem*, the*problem*of estimating an origin/destination matrix*and*certain*concave*cost*network**flow**problems*.” {*For*the entire collection see MR 87a:90057.} ...##
###
Bilinear modeling solution approach for fixed charge network flow problems

2009
*
Optimization Letters
*

We present

doi:10.1007/s11590-009-0114-0
fatcat:ibrlyh24rfgn7ezlv4k3sai3lu
*a*continuous, bilinear formulation*for*the fixed charge*network**flow**problem*. ... This formulation is used to derive an exact*algorithm**for*the fixed charge*network**flow**problem*converging in*a*finite number of steps. ... Exact solution methods*for*the fixed charge*network**flow**problem*often utilize*a*binary mixed integer programming formulation together with*Branch*&*Bound*[11, 4, 24, 15] ,*Branch*& Cut 2 TWO MATHEMATICAL ...##
###
On the Topological Design of Distributed Computer Networks

1977
*
IRE Transactions on Communications Systems
*

Absrmcr-The

doi:10.1109/tcom.1977.1093709
fatcat:mbal4fgcdjhrlfeqr5icerocqi
*problem*of data transmission in*a**network*environment involves the design of*a*communication subnetwork. ... We state the general design*problem*, decompose it into simpler subproblems, discuss the solutions to these subproblems,*and*then suggest*a*heuristic topological design procedure as*a*solution to the original ... FD*algorithm*(*for**concave*objective function): Step 0 : Let f(O) be*a*feasible starting*flow*. Let p = 0. ...##
###
Page 851 of The Journal of the Operational Research Society Vol. 48, Issue 8
[page]

1997
*
The Journal of the Operational Research Society
*

mini- mum

*concave*cost*flow**problem**and*the single source uncapacitated minimum*concave*cost*flow**problem*). ... An interesting special case of decom- position is presented more analytically, that of*concave*minimisation that relates to*networks*(the minimum*concave*cost*flow**problem**and*its variants, the uncapacitated ...##
###
Page 278 of The Journal of the Operational Research Society Vol. 48, Issue 3
[page]

1997
*
The Journal of the Operational Research Society
*

All rights reserved. 0160-5682/97 $12.00 ~~)
New formulation

*and*relaxation to solve*a**concave*-cost*network**flow**problem**A*Amiri! ... Another*problem*that can be modeled as*a**concave*-cost*network**flow**problem*is the design of*a*local area communication*network*. ...##
###
New Formulation and Relaxation to Solve a Concave-Cost Network Flow Problem

1997
*
Journal of the Operational Research Society
*

All rights reserved. 0160-5682/97 $12.00 ~~)
New formulation

doi:10.2307/3010426
fatcat:lpfbddj2nrcwxpyicvm3nxgxxi
*and*relaxation to solve*a**concave*-cost*network**flow**problem**A*Amiri! ... Another*problem*that can be modeled as*a**concave*-cost*network**flow**problem*is the design of*a*local area communication*network*. ...##
###
Page 584 of Mathematical Reviews Vol. , Issue 95a
[page]

1995
*
Mathematical Reviews
*

*A*new

*branch*-

*and*-

*bound*

*algorithm*is introduced to solve mini- mum piecewise linear

*concave*cost

*network*

*flow*

*problems*where the number of pieces

*for*each arc cost is at most equal to two. ... (NZ-CANT-MG; Christchurch) An improved

*branch*

*and*

*bound*

*algorithm*

*for*minimum

*concave*cost

*network*

*flow*

*problems*. (English summary) J. Global Optim. 3 (1993), no. 3, 261-287. ...

##
###
Page 5974 of Mathematical Reviews Vol. , Issue 2001H
[page]

2001
*
Mathematical Reviews
*

Summary: “We discuss the polynomial solvability of the mini- mum

*concave*cost*network**flow**problem*(MCCNFP) with fixed numbers of sources*and*nonlinear arc costs*and*present some approximation*algorithms*... In this paper we propose an efficient method*for*this*problem*, based on*a*Lagrangian heuristic within*a**branch*-*and*-*bound*framework. ...##
###
Optimal Flow in Dynamic Networks with Nonlinear Cost Functions on Edges
[chapter]

2003
*
IFIP Advances in Information and Communication Technology
*

*A*general procedure

*for*solving the

*problem*using the time-expanded

*network*is described. The main properties of dynamic

*flows*on

*networks*with

*concave*cost functions are studied. ... We propose an

*algorithm*

*for*finding the optimal

*flow*in

*networks*with exactly one source; its running time is polynomial

*for*

*a*fixed number of sinks. ... We show that in the case of uncapacitated

*networks*with

*concave*cost functions

*and*infinite time horizon, as well as

*for*

*a*wide range of fininte time

*bounds*, there exists an optimal

*flow*such that the ...

##
###
Page 3944 of Mathematical Reviews Vol. , Issue 87g
[page]

1987
*
Mathematical Reviews
*

Summary (translated from the Russian): “We give

*a*description of*a*combined (hybrid)*branch**and**bound**algorithm**for*solution of the travelling salesman*problem**and**for*its computer implemen- tation. ... Kh. 87g:90057 Computer implementation of*a*combined*branch**and**bound**algorithm**for*the traveling salesman*problem*. (Russian) Zh. Vychisl. Mat. i Mat. Fiz. 26 (1986), no. 5, 664-672, 797. ...##
###
Page 8259 of Mathematical Reviews Vol. , Issue 98M
[page]

1998
*
Mathematical Reviews
*

8259

*network**flow**problem*as an integer*concave*minimization*problem*, we establish finite*branch**and**bound**algorithms*, in which the*branching*operation is the so-called integral rectangular partition*and*...*For*the special case that the*flow*cost function is*concave*on*a*fixed number of arcs*and*linear on the others, an upper*bound*of the running time is given.” 98m:90174 90C35 05C85 Nagamochi, Hiroshi (J-K ...##
###
Distributed network utility maximization in wireless networks with a bounded number of paths

2008
*
Proceedings of the 3nd ACM workshop on Performance monitoring and measurement of heterogeneous wireless and wired networks - PM2HW2N '08
*

We develop

doi:10.1145/1454630.1454645
dblp:conf/mswim/SchumacherH08
fatcat:2tsq5nrjr5asveiwhk45ur6wme
*a*dual decomposition based distributed*algorithm**for*solving the*problem*, show the optimality of*a*stationary solution,*and*compare the performance of the*algorithm*with*a*centralized*branch*-*and*-*bound*... We consider the fair multicommodity*flow**problem*in multihop wireless*networks*. ... The*problem*formulation*and*our*branch*-*and*-*bound**algorithm*are similar to those of Caramia*and*Sgalambro [17] , who propose*a**branch*-*and*-*bound**algorithm**for*the maximum concurrent k-splittable*flow**problem*...##
###
Page 340 of The Journal of the Operational Research Society Vol. 59, Issue 3
[page]

2008
*
The Journal of the Operational Research Society
*

Simulated Annealing: Theory

*and*Applications. D. Reidel Publishing Company: Boston. Lamar BW (1993). An improved*branch**and**bound**algorithm**for*minimum*concave*cost*network**flow**problems*. ... Larsson T, Migdalas*A**and*Ronnqvist M (1994).*A*lagrangian heuristic*for*the capacitated*concave*minimum cost*network**flow**problem*. Eur J Opl Res 78: 116-129. ...
« Previous

*Showing results 1 — 15 out of 4,913 results*