A note on quasi-equilibrium problems

The purpose of this paper is to prove the existence of solutions of quasi-equilibrium problems without any generalized monotonicity assumption. Additionally, we give some applications.     

A review of urban transportation network design problems

This paper presents a comprehensive review of the definitions, classifications, objectives, constraints, network topology decision variables, and solution methods of the Urban Transportation Network Design Problem (UTNDP), which includes both the Road Network Design Problem (RNDP) and the Public Transit Network Design Problem (PTNDP). The current trends and gaps in each class of the problem are discussed and future directions in terms of both modeling and solution approaches are given. This review intends to provide a bigger picture of transportation network design problems, allow comparisons of formulation approaches and solution methods of different problems in various classes of UTNDP, and encourage cross-fertilization between the RNDP and PTNDP research.     

A note on asymptotic behavior of solutions for the one-dimensional bipolar Euler-Poisson system

In this note, we consider a one-dimensional bipolar Euler-Poisson system (hydrodynamic model). This system takes the form of Euler-Poisson with electric field and frictional damping added to the momentum equations. When n₊≠n₋, paper [I. Gasser, L. Hsiao, H.-L. Li, Large time behavior of solutions of the bipolar hydrodynamical model for semiconductors, J. Differential Equations 192 (2003) 326-359] discussed the asymptotic behavior of small smooth solutions to the Cauchy problem of the one-dimensional bipolar Euler-Poisson system. Subsequent to [I. Gasser, L. Hsiao, H.-L. Li, Large time behavior of solutions of the bipolar hydrodynamical model for semiconductors, J. Differential Equations 192 (2003) 326-359], we investigate the asymptotic behavior of solutions to the Cauchy problem with , and obtain the optimal convergence rate toward the constant state . We accomplish the proofs by energy estimates and the decay rates of fundamental solutions of the heat-type equations.     

A note on the asymptotic behaviour of bottleneck problems

We generalize and sharpen results of Burkard and Fincke concerning the asymptotic behaviour of a certain class of combinatorial optimization problems with bottleneck objective function. In this way several open questions are answered.     

Transportation problems which can be solved by the use of hirsch-paths for the dual problems

Balinski uses his signature method for the proof of the Hirsch-conjecture for dual transportation polyhedra to obtain an efficient algorithm for the assignment problem. We will show how to extend this method to other primal transportation problems, including transportation problems with unit demands. We then prove that Balinski's assignment algorithm is equivalent, cycle by cycle, to that of Hung and Rom. We demonstrate that, under some assumptions for our probability model, a modification of the latter algorithm has an average complexity of O(n ²logn) and present some computational results confirming this. We also present results that indicate that this modification compares favorably with Balinski's algorithm and other codes. Research of both authors supported, in part, by grants of the Alexander von Humboldt-Stiftung. Supported, in part, by NSF grant DMS-8504050.     

A note on ‘the assignment problem under categorized jobs’

Some recent results connected with long transportation problems are discussed.     

Diagnosing infeasibilities in network flow problems

We consider the problem of finding a feasible flow in a directed networkG = (N,A) in which each nodei N has a supplyb(i), and each arc(i,j) A has a zero lower bound on flow and an upper boundu _ij . It is well known that this feasibility problem can be transformed into a maximum flow problem. It is also well known that there is no feasible flow in the networkG if and only if there is a subsetS of nodes such that the net supplies of the nodes inS exceeds the capacity of the arcs emanating fromS. Such a setS is called awitness of infeasibility (or, simply, awitness) of the network flow problem. In the case that there are many different witnesses for an infeasible problem, a small cardinality witness may be preferable in practice because it is generally easier for the user to assimilate, and may provide more guidance to the user on how to identify the cause of the infeasibility. Here we show that the problem of finding a minimum cardinality witness is NP-hard. We also consider the problem of determining aminimal witness, that is, a witnessS such that no proper subset ofS is also a witness. In this paper, we show that we can determine a minimal witness by solving a sequence of at mostn maximum flow problems. Moreover, if we use the preflow-push algorithm to solve the resulting maximum flow problems and organize computations properly, then the total time taken by the algorithm is comparable to that of solving a single maximum flow problem. This approach determines a minimal cardinality witness in O(n ² m ^1/2) time using simple data structures and in O(nm logn) time using the standard implementation of the dynamic tree data structures. We also show that the recognition version of the minimal witness problem is equivalent to a recognition version of a related problem known as theminimum rooted cut problem. © 1998 The Mathematical Programming Society, Inc. Published by Elsevier Science B.V.Corresponding author.     

A note on singular nonlinear boundary value problems for the one-dimensional p-Laplacian

Existence theorems about the positive solution for the singular equation (ϕ_p(y′))′ + f(t,y) = 0, y(0) = y(1) = 0 are established. The results are obtained by using a fixed-point theorem in cones.     

强部分逆网络流问题

Abstract. In this paper,a new model for inverse network flow problems,robust partial inverseproblem is presented. For a given partial solution,the robust partial inverse problem is to modify the coefficients optimally such that all full solutions containing the partial solution becomeoptimal under new coefficients. It has been shown that the robust partial inverse spanning treeproblem can be formulated as a combinatorial linear program,while the robust partial inverseminimum cut problem and the robust partial inverse assignment problem can be solved by combinatorial strongly polynomial algorithms.     

A note on primal network flow algorithms

Klein [1967] andDomschke [1973] have developed primal algorithms for network flow problems. An alternative derivation shows that these algorithms implicitly take advantage of duality and end up with an optimal dual solution.

---

Zusammenfassung Ausgangspunkt dieser Arbeit sind die Algorithmen vonKlein [1967] undDomschke [1973] zur Bestimmung kostenminimaler Flüsse in Netzwerken. Es werden allgemein interessierende Zusammenhänge zwischen primalen und primal-dualen Algorithmen aufgezeigt.

     

A note on the complexity of flow shop scheduling with transportation constraints

This note investigates two-machine flow shop scheduling with transportation constraints to minimize makespan. Recently, Soukhal et al. [A. Soukhal, A. Oulamara, P. Martineau, Complexity of flow shop scheduling problems with transportation constraints, European Journal of Operational Research 161 (2005) 32–41] proved that this problem is strongly NP-hard when the capacity of the truck is limited to two or three parts. The considered problem with blocking constraints is also proved to be strongly NP-hard by Soukhal et al. Unfortunately, their proofs contain mistakes. We point out their proofs’ invalidity and then show that, when the capacity of the truck is limited to two parts, the problem is binary NP-hard, and when the capacity of the truck is limited to three parts the problem is strongly NP-hard even if the jobs have a common processing time on machine one and all jobs have the same transportation time. We show also that the last result can be generalized to any fixed c (c ? 3) parts.     

A complete asymptotic expansion for a sequence of certain sums

In the present note we derive a complete asymptotic expansion for a sequence of certain sums. A special case of our results solves a problem recently proposed in the Research Group in Mathematical Inequalities and Applications (RGMIA) mailing list. Moreover, the result is connected with a certain combinatorial problem.     

A note on asymptotic homomorphisms

Using the notion of asymptotic homomorphism due to Connes and Higson we construct bivariant homology-cohomology theories for separableC*-algebras, which satisfy general excision axioms and are nonperiodic.     

Persistency in the assignment and transportation problems

LetG = (U,V,E) be a bipartite graph with weights of its edgesc _ij . For the assignment and transportation problem given by such a graph we propose efficient procedures for partitioning the edge setE into three classes:E _o is the set of edgesij withx _ij = 0 for each optimum solution (0-persistent edges);E ₁ is the set of edges withx _ij > 0 and constant for each optimum (1-persistent edges) andE _w is the set of edges such that there are two optimum solutions x, x withx _ij x _ij ¹ (weakly persistent edges).     

Adaptive dynamic cost updating procedure for solving fixed charge network flow problems

We approximate the objective function of the fixed charge network flow problem (FCNF) by a piecewise linear one, and construct a concave piecewise linear network flow problem (CPLNF). A proper choice of parameters in the CPLNF problem guarantees the equivalence between those two problems. We propose a heuristic algorithm for solving the FCNF problem, which requires solving a sequence of CPLNF problems. The algorithm employs the dynamic cost updating procedure (DCUP) to find a solution to the CPLNF problems. Preliminary numerical experiments show the effectiveness of the proposed algorithm. In particular, it provides a better solution than the dynamic slope scaling procedure in less CPU time. Research was partially supported by NSF and Air Force grants.     

A note on symmetry reduction for circular traveling tournament problems

The traveling tournament problem (TTP) consists of finding a distance-minimal double round-robin tournament where the number of consecutive breaks is bounded. Easton et al. (2001) introduced the so-called circular TTP instances, where venues of teams are located on a circle. The distance between neighboring venues is one, so that the distance between any pair of teams is the distance on the circle. It is empirically proved that these instances are very hard to solve due to the inherent symmetry. This note presents new ideas to cut off essentially identical parts of the solution space. Enumerative solution approaches, e.g. relying on branch-and-bound, benefit from this reduction. We exemplify this benefit by modifying the DFS∗ algorithm of Uthus et al. (2009) and show that speedups can approximate factor 4n.     

A two-objective mathematical model without cutting patterns for one-dimensional assortment problems

This paper considers a one-dimensional cutting stock and assortment problem. One of the main difficulties in formulating and solving these kinds of problems is the use of the set of cutting patterns as a parameter set in the mathematical model. Since the total number of cutting patterns to be generated may be very huge, both the generation and the use of such a set lead to computational difficulties in solution process. The purpose of this paper is therefore to develop a mathematical model without the use of cutting patterns as model parameters. We propose a new, two-objective linear integer programming model in the form of simultaneous minimization of two contradicting objectives related to the total trim loss amount and the total number of different lengths of stock rolls to be maintained as inventory, in order to fulfill a given set of cutting orders. The model does not require pre-specification of cutting patterns. We suggest a special heuristic algorithm for solving the presented model. The superiority of both the mathematical model and the solution approach is demonstrated on test problems.     

A note on singular nonlinear boundary value problems

In this paper we study the existence and multiplicity of solutions of the following operator equation in Banach space E:

u=λAu,0<λ<+∞,u∈P?{θ},